Random access sequence generation method, device, and system

ABSTRACT

Embodiments of the present application provide a random access sequence generation method, and an apparatus. The method includes: generating, by a base station, notification signaling, where the notification signaling includes indication information, the indication information is used to instruct user equipment UE to select a shift sequence number from a range of 0 to (n shift   RA n group   RA + n   shift   RA + n   shift   RA +   shift   RA   −1 ), the shift sequence number is an integer, n shift   RA  is a quantity of UE candidate sequence shifts in a group, n group   RA  is a quantity of groups,  n   shift   RA  is a quantity of UE candidate sequence shifts in the last length that is insufficient for a group,  n   shift   RA  is a quantity of UE candidate sequence shifts in first remaining sequence shifts, and    shift   RA  is a quantity of UE candidate sequence shifts in second remaining sequence shifts; and sending, by the base station, the notification signaling to the UE, so that the UE generates a random access sequence according to the indication information.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 15/928,496, filed on Mar. 22, 2018, which is a continuation of International Application No. PCT/CN2015/090838, filed on Sep. 25, 2015. The afore-mentioned patent applications are hereby incorporated by reference in their entireties.

TECHNICAL FIELD

Embodiments of the present application relate to communications technologies, and in particular, to a random access sequence generation method, a device, and a system.

BACKGROUND

If user equipment (UE) communicates with a base station when the UE moves at a high speed, there is a change between signal frequencies at receive ends of the UE and the base station. The change is referred to as a Doppler frequency shift.

In the conventional art, to avoid a problem that random access sequences of multiple UEs interfere with each other when the Doppler frequency shift is greater than one time a physical random access channel (PRACH) subcarrier spacing and is less than two times the PRACH subcarrier spacing, a targeted design is made. In the conventional art, sequence shifts are grouped, three parameters, that is, a quantity of groups, a quantity of UE candidate sequence shifts in a group, and a quantity of UE candidate sequence shifts in the last length that is insufficient for a group, are determined, and a shift sequence number is selected from an interval that is determined according to the three parameters.

However, in the conventional art, a range from which a shift sequence number is selected is excessively small.

SUMMARY

Embodiments of the present application provide a random access sequence generation method, a device, and a system.

According to a first aspect, an embodiment of the present application provides a random access sequence generation method, including:

generating, by a base station, notification signaling, where the notification signaling includes indication information, the indication information is used to instruct user equipment UE to select a shift sequence number from a range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the shift sequence number is an integer, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in a group, n_(group) ^(RA) is a quantity of groups, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in the last length that is insufficient for a group, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in first remaining sequence shifts, and

_(shift) ^(RA) is a quantity of UE candidate sequence shifts in second remaining sequence shifts; and

sending, by the base station, the notification signaling to the UE, so that the UE generates a random access sequence according to the indication information.

With reference to the first aspect, in a first possible implementation of the first aspect, after the sending, by the base station, the notification signaling to the UE, the method further includes:

selecting, by the base station, a shift sequence number from the range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1);

obtaining, by the base station, a cyclic shift value according to the shift sequence number; and

generating, by the base station, a detection sequence according to the cyclic shift value, and detecting, by using the detection sequence, the random access sequence sent by the UE, where the random access sequence is generated by the UE according to the indication information.

With reference to the first possible implementation of the first aspect, in a second possible implementation of the first aspect, the obtaining, by the base station, a cyclic shift value according to the shift sequence number includes:

obtaining, by the base station, the cyclic shift value C_(ν) according to the shift sequence number ν by using the following formula (1), formula (2), or formula (3): C _(ν) =d _(offset) +d _(start) └ν/n _(shift) ^(RA)┘+(ν mod n _(shift) ^(RA))N _(CS)  (1); C _(ν) =d _(offset) +d _(start)+(ν−n _(shift) ^(RA) n _(group) ^(RA) +n _(shift) ^(RA))N _(CS)  (2); C _(ν) =d _(offset) +

_(start)+(ν−n _(shift) ^(RA) n _(group) ^(RA) +n _(shift) ^(RA) +n _(shift) ^(RA))N _(CS)  (3), where

d_(offset) is a shift offset, d_(start) is a cyclic shift distance between neighboring groups, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in a group, N_(CS) is a quantity of cyclic shifts that are occupied by a user, d _(start) is a cyclic shift value of a first UE candidate sequence shift in the first remaining sequence shifts, and

is a cyclic shift value of a first UE candidate sequence shift in the second remaining sequence shifts.

With reference to the second possible implementation of the first aspect, in a third possible implementation of the first aspect, in the case of ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1), the base station obtains the cyclic shift value C_(ν) by using formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1), the base station obtains the cyclic shift value C_(ν) by using formula (2);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the base station obtains the cyclic shift value C_(ν) by using formula (3).

With reference to the second or the third possible implementation of the first aspect, in a fourth possible implementation of the first aspect, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), where

formulas (4) to (11) are respectively:

$\begin{matrix} {{n_{shift}^{RA} = \left\lfloor \frac{{4d_{u}} - N_{ZC}}{N_{CS}} \right\rfloor};} & (4) \\ {{d_{start} = {{4d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (5) \\ {{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor};} & (6) \\ {{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{N_{ZC} - {3d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};} & (7) \\ {{{\overset{\overset{\_}{\_}}{n}}_{shift}^{RA} = \left\lfloor {{\min\left( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} \right)}\text{/}N_{CS}} \right\rfloor};} & (8) \\ {{{\overset{\overset{\_}{\_}}{d}}_{start} = {N_{ZC} - {3d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};} & (9) \\ {{\overset{\overset{\overset{\_}{\_}}{\_}}{n}}_{shift}^{RA} = \left\lfloor {{\left( {{\left( {1 - {\min\left( {1,{\overset{\_}{n}}_{shift}^{RA}} \right)}} \right)\left( {d_{u} - {n_{group}^{RA} \cdot d_{start}}} \right)} + {{\min\left( {1,{{\overset{\_}{n}}_{shift}^{RA}\left( {{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}} \right)}} \right)}\text{/}N_{CS}}} \right\rfloor - {\overset{\overset{\_}{\_}}{n}}_{shift}^{RA}};} \right.} & (10) \\ {{{\overset{\overset{\overset{\_}{\_}}{\_}}{d}}_{start} = {N_{ZC} - {2d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\overset{\_}{\_}}{n}}_{shift}^{RA}N_{CS}}}},} & (11) \end{matrix}$ where

d_(u) is a cyclic shift corresponding to the random access sequence when a Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the second or the third possible implementation of the first aspect, in a fifth possible implementation of the first aspect, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19), where formulas (12) to (19) are respectively:

$\begin{matrix} {{n_{shift}^{RA} = \left\lfloor \frac{N_{ZC} - {3d_{u}}}{N_{CS}} \right\rfloor};} & (12) \\ {{d_{start} = {N_{ZC} - {3d_{u}} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (13) \\ {{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor};} & (14) \\ {{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{{4d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};} & (15) \\ {{{\overset{\overset{\_}{\_}}{n}}_{shift}^{RA} = \left\lfloor {{\min\left( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{N_{ZC} - {3d_{u}} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} \right)}\text{/}N_{CS}} \right\rfloor};} & (16) \\ {{{\overset{\overset{\_}{\_}}{d}}_{start} = {d_{u} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};} & (17) \\ {{{\overset{\overset{\overset{\_}{\_}}{\_}}{n}}_{shift}^{RA} = 0};} & (18) \\ {{{\overset{\overset{\overset{\_}{\_}}{\_}}{d}}_{start} = 0},} & (19) \end{matrix}$ where

d_(u) is a cyclic shift corresponding to the random access sequence when a Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the second or the third possible implementation of the first aspect, in a sixth possible implementation of the first aspect, shift, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), where

formulas (20) to (27) are respectively:

$\begin{matrix} {{n_{shift}^{RA} = \left\lfloor \frac{{3d_{u}} - N_{ZC}}{N_{CS}} \right\rfloor};} & (20) \\ {{d_{start} = {{3d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (21) \\ {{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor};} & (22) \\ {{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{N_{ZC} - {2d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};} & (23) \\ {{{\overset{\overset{\_}{\_}}{n}}_{shift}^{RA} = 0};} & (24) \\ {{{\overset{\overset{\_}{\_}}{d}}_{start} = 0};} & (25) \\ {{{\overset{\overset{\overset{\_}{\_}}{\_}}{n}}_{shift}^{RA} = 0};} & (26) \\ {{{\overset{\overset{\overset{\_}{\_}}{\_}}{d}}_{start} = 0},} & (27) \end{matrix}$ where

d_(u) is a cyclic shift corresponding to the random access sequence when a Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the second or the third possible implementation of the first aspect, in a seventh possible implementation of the first aspect, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35), where

formulas (28) to (35) are respectively:

$\begin{matrix} {{n_{shift}^{RA} = \left\lfloor \frac{N_{ZC} - {2d_{u}}}{N_{CS}} \right\rfloor};} & (28) \\ {{d_{start} = {{2\left( {N_{ZC} - {2d_{u}}} \right)} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (29) \\ {{n_{group}^{RA} = \left\lfloor \frac{N_{ZC} - d_{u}}{d_{start}} \right\rfloor};} & (30) \\ {{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{{3d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};} & (31) \\ {{{\overset{\overset{\_}{\_}}{n}}_{shift}^{RA} = 0};} & (32) \\ {{{\overset{\overset{\_}{\_}}{d}}_{start} = 0};} & (33) \\ {{{\overset{\overset{\overset{\_}{\_}}{\_}}{n}}_{shift}^{RA} = 0};} & (34) \\ {{{\overset{\overset{\overset{\_}{\_}}{\_}}{d}}_{start} = 0},} & (35) \end{matrix}$ where

d_(u) is a cyclic shift corresponding to the random access sequence when a Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to any one of the fourth to the seventh possible implementations of the first aspect, in an eighth possible implementation of the first aspect, in the case of

$\mspace{11mu}{{\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},}$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or in the case of

$\mspace{11mu}{{\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},}$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (12) to (19);

in the case of

$\mspace{11mu}{{\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},}$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35); or in the case of

$\mspace{11mu}{{\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2N_{ZC}}{5}},}$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (28) to (35).

According to a second aspect, an embodiment of the present application provides a random access sequence generation method, including:

receiving, by user equipment UE, notification signaling from a base station, where the notification signaling includes indication information, the indication information is used to instruct the UE to select a shift sequence number from a range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the shift sequence number is an integer, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in a group, n_(group) ^(RA) is a quantity of groups, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in the last length that is insufficient for a group, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in first remaining sequence shifts, and

_(shift) ^(RA) is a quantity of UE candidate sequence shifts in second remaining sequence shifts;

selecting, by the UE, a shift sequence number from the range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1) according to the notification signaling;

obtaining, by the UE, a cyclic shift value according to the shift sequence number; and

generating, by the UE, a random access sequence according to the cyclic shift value.

With reference to the second aspect, in a first possible implementation of the second aspect, the obtaining, by the UE, a cyclic shift value according to the shift sequence number includes:

obtaining, by the UE, the cyclic shift value C_(ν) according to the shift sequence number ν by using the following formula (1), formula (2), or formula (3): C _(ν) =d _(offset) +d _(start) └ν/n _(shift) ^(RA)┘+(ν mod n _(shift) ^(RA))N _(CS)  (1); C _(ν) =d _(offset) +d _(start)+(ν−n _(shift) ^(RA) n _(group) ^(RA) +n _(shift) ^(RA))N _(CS)  (2); C _(ν) =d _(offset) +

_(start)+(ν−n _(shift) ^(RA) n _(group) ^(RA) +n _(shift) ^(RA) +n _(shift) ^(RA))N _(CS)  (3), where

d_(offset) is a shift offset, d_(start) is a cyclic shift distance between neighboring groups, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in a group, N_(CS) is a quantity of cyclic shifts that are occupied by a user, d _(start) is a cyclic shift value of a first UE candidate sequence shift in the first remaining sequence shifts, and

is a cyclic shift value of a first UE candidate sequence shift in the second remaining sequence shifts.

With reference to the first possible implementation of the second aspect, in a second possible implementation of the second aspect, in the case of ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1), the UE obtains the cyclic shift value C_(ν) by using formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1), the UE obtains the cyclic shift value C_(ν) by using formula (2);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the UE obtains the cyclic shift value C_(ν) by using formula (3).

With reference to the first or the second possible implementation of the second aspect, in a third possible implementation of the second aspect, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), where

formulas (4) to (11) are respectively:

$\begin{matrix} {{n_{shift}^{RA} = \left\lfloor \frac{{4d_{u}} - N_{ZC}}{N_{CS}} \right\rfloor};} & (4) \\ {{d_{start} = {{4d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (5) \\ {{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor};} & (6) \\ {{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{N_{ZC} - {3d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};} & (7) \\ {{{\overset{=}{n}}_{shift}^{RA} = \left\lfloor {{\min\left( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} \right)}\text{/}N_{CS}} \right\rfloor};} & (8) \\ {{{\overset{=}{d}}_{start} = {N_{ZC} - {3d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};} & (9) \\ {{{\overset{\equiv}{n}}_{shift}^{RA} = {\left\lfloor {\left( {{\left( {1 - {\min\left( {1,{\overset{\_}{n}}_{shift}^{RA}} \right)}} \right)\left( {d_{u} - {n_{group}^{RA} \cdot d_{start}}} \right)} + {{\min\left( {1,{\overset{\_}{n}}_{shift}^{RA}} \right)}\left( {{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}} \right)}} \right)\text{/}N_{CS}} \right\rfloor - {\overset{=}{n}}_{shift}^{RA}}};} & (10) \\ {{{\overset{\equiv}{d}}_{start} = {N_{ZC} - {2d_{u}} + {n_{group}^{Ra} \cdot d_{start}} + {{\overset{=}{n}}_{shift}^{RA}N_{CS}}}},} & (11) \end{matrix}$ where

d_(u) is a cyclic shift corresponding to the random access sequence when a Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the first or the second possible implementation of the second aspect, in a fourth possible implementation of the second aspect, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19), where

formulas (12) to (19) are respectively:

$\begin{matrix} {{n_{shift}^{RA} = \left\lfloor \frac{N_{ZC} - {3d_{u}}}{N_{CS}} \right\rfloor};} & (12) \\ {{d_{start} = {N_{ZC} - {3d_{u}} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (13) \\ {{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor};} & (14) \\ {{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{{4d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};} & (15) \\ {{{\overset{=}{n}}_{shift}^{RA} = \left\lfloor {{\min\left( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{N_{ZC} - {3d_{u}} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} \right)}\text{/}N_{CS}} \right\rfloor};} & (16) \\ {{{\overset{=}{d}}_{start} = {d_{u} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};} & (17) \\ {{{\overset{\equiv}{n}}_{shift}^{RA} = 0};} & (18) \\ {{{\overset{\equiv}{d}}_{start} = 0},} & (19) \end{matrix}$ where

d_(u) is a cyclic shift corresponding to the random access sequence when a Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the first or the second possible implementation of the second aspect, in a fifth possible implementation of the second aspect, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), where

formulas (20) to (27) are respectively:

$\begin{matrix} {{n_{shift}^{RA} = \left\lfloor \frac{{3d_{u}} - N_{ZC}}{N_{CS}} \right\rfloor};} & (20) \\ {{d_{start} = {{3d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (21) \\ {{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor};} & (22) \\ {{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{N_{ZC} - {2d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};} & (23) \\ {{{\overset{=}{n}}_{shift}^{RA} = 0};} & (24) \\ {{{\overset{=}{d}}_{start} = 0};} & (25) \\ {{{\overset{\equiv}{n}}_{shift}^{RA} = 0};} & (26) \\ {{{\overset{\equiv}{d}}_{start} = 0},} & (27) \end{matrix}$ where

d_(u) is a cyclic shift corresponding to the random access sequence when a Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the first or the second possible implementation of the second aspect, in a sixth possible implementation of the second aspect, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35), where

formulas (28) to (35) are respectively:

$\begin{matrix} {{n_{shift}^{RA} = \left\lfloor \frac{N_{ZC} - {2d_{u}}}{N_{CS}} \right\rfloor};} & (28) \\ {{d_{start} = {{2\left( {N_{ZC} - {2d_{u}}} \right)} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (29) \\ {{n_{group}^{RA} = \left\lfloor \frac{N_{ZC} - d_{u}}{d_{start}} \right\rfloor};} & (30) \\ {{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{{3d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};} & (31) \\ {{{\overset{=}{n}}_{shift}^{RA} = 0};} & (32) \\ {{{\overset{=}{d}}_{start} = 0};} & (33) \\ {{{\overset{\equiv}{n}}_{shift}^{RA} = 0};} & (34) \\ {{{\overset{\equiv}{d}}_{start} = 0},} & (35) \end{matrix}$ where

d_(u) is a cyclic shift corresponding to the random access sequence when a Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to any one of the third to the sixth possible implementations of the second aspect, in a seventh possible implementation of the second aspect, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (12) to (19);

in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

start satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35); or in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (28) to (35).

With reference to any one of the second aspect, or the first to the seventh possible implementations of the second aspect, in an eighth possible implementation of the second aspect, the generating, by the UE, a random access sequence according to the cyclic shift value includes:

generating, by the UE, the random access sequence x_(u,C) _(ν) (n) according to the cyclic shift value C_(ν) by using the following formula (36): x _(u,C) _(ν) (n)=x _(u)((n+C _(ν))mod N _(ZC))  (36), where

N_(ZC) is a sequence length, and a ZC sequence whose root is u is defined as:

${{x_{u}(n)} = e^{{- j}\;\frac{\pi\;{un}{({n + 1})}}{N_{ZC}}}},$ 0≤n≤N_(ZC)−1.

According to a third aspect, an embodiment of the present application provides a random access sequence generation method, including:

selecting, by a base station, a shift sequence number ν from a range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), where ν is an integer, n_(shift) ^(RA) is a quantity of user equipment UE candidate sequence shifts in a group, n_(group) ^(RA) is a quantity of groups, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in the last length that is insufficient for a group, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in first remaining sequence shifts, and

_(shift) ^(RA) is a quantity of UE candidate sequence shifts in second remaining sequence shifts; and obtaining, by the base station, a cyclic shift value C_(ν) according to the shift sequence number ν by using the following formula (1), formula (2), or formula (3): C _(ν) =d _(offset) +d _(start) └ν/n _(shift) ^(RA)┘+(ν mod n _(shift) ^(RA))N _(CS)  (1); C _(ν) =d _(offset) +d _(start)+(ν−n _(shift) ^(RA) n _(group) ^(RA) +n _(shift) ^(RA))N _(CS)  (2); C _(ν) =d _(offset) +

_(start)+(ν−n _(shift) ^(RA) n _(group) ^(RA) +n _(shift) ^(RA) +n _(shift) ^(RA))N _(CS)  (3), where

d_(offset) is a shift offset, d_(start) is a cyclic shift distance between neighboring groups, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in a group, N_(CS) is a quantity of cyclic shifts that are occupied by a user, d _(start) is a cyclic shift value of a first UE candidate sequence shift in the first remaining sequence shifts, and

is a cyclic shift value of a first UE candidate sequence shift in the second remaining sequence shifts, where

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (4) to (11); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35), where

$\begin{matrix} {{n_{shift}^{RA} = \left\lfloor \frac{{4d_{u}} - N_{ZC}}{N_{CS}} \right\rfloor};} & (4) \\ {{d_{start} = {{4d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (5) \\ {{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor};} & (6) \\ {{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{N_{ZC} - {3d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};} & (7) \\ {{{\overset{=}{n}}_{shift}^{RA} = \left\lfloor {{\min\left( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} \right)}\text{/}N_{CS}} \right\rfloor};} & (8) \\ {{{\overset{=}{d}}_{start} = {N_{ZC} - {3d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};} & (9) \\ {{{\overset{\equiv}{n}}_{shift}^{RA} = {\left\lfloor {\left( {{\left( {1 - {\min\left( {1,{\overset{\_}{n}}_{shift}^{RA}} \right)}} \right)\left( {d_{u} - {n_{group}^{RA} \cdot d_{start}}} \right)} + {{\min\left( {1,{\overset{\_}{n}}_{shift}^{RA}} \right)}\left( {{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}} \right)}} \right)\text{/}N_{CS}} \right\rfloor - {\overset{=}{n}}_{shift}^{RA}}};} & (10) \\ {{{\overset{\equiv}{d}}_{start} = {N_{ZC} - {2d_{u}} + {n_{group}^{Ra} \cdot d_{start}} + {{\overset{=}{n}}_{shift}^{RA}N_{CS}}}};} & (11) \\ {{n_{shift}^{RA} = \left\lfloor \frac{N_{ZC} - {3d_{u}}}{N_{CS}} \right\rfloor};} & (12) \\ {{d_{start} = {N_{ZC} - {3d_{u}} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (13) \\ {{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor};} & (14) \\ {{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{{4d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};} & (15) \\ {{{\overset{=}{n}}_{shift}^{RA} = \left\lfloor {{\min\left( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{N_{ZC} - {3d_{u}} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} \right)}\text{/}N_{CS}} \right\rfloor};} & (16) \\ {{{\overset{=}{d}}_{start} = {d_{u} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};} & (17) \\ {{{\overset{\equiv}{n}}_{shift}^{RA} = 0};} & (18) \\ {{{\overset{\equiv}{d}}_{start} = 0};} & (19) \\ {{n_{shift}^{RA} = \left\lfloor \frac{{3d_{u}} - N_{ZC}}{N_{CS}} \right\rfloor};} & (20) \\ {{d_{start} = {{3d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (21) \\ {{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor};} & (22) \\ {{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{N_{ZC} - {2d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};} & (23) \\ {{{\overset{=}{n}}_{shift}^{RA} = 0};} & (24) \\ {{{\overset{=}{d}}_{start} = 0};} & (25) \\ {{{\overset{\equiv}{n}}_{shift}^{RA} = 0};} & (26) \\ {{{\overset{\equiv}{d}}_{start} = 0};} & (27) \\ {{n_{shift}^{RA} = \left\lfloor \frac{N_{ZC} - {2d_{u}}}{N_{CS}} \right\rfloor};} & (28) \\ {{d_{start} = {{2\left( {N_{ZC} - {2d_{u}}} \right)} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (29) \\ {{n_{group}^{RA} = \left\lfloor \frac{N_{ZC} - d_{u}}{d_{start}} \right\rfloor};} & (30) \\ {{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{{3d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};} & (31) \\ {{{\overset{=}{n}}_{shift}^{RA} = 0};} & (32) \\ {{{\overset{=}{d}}_{start} = 0};} & (33) \\ {{{\overset{\equiv}{n}}_{shift}^{RA} = 0};} & (34) \\ {{{\overset{\equiv}{d}}_{start} = 0},} & (35) \end{matrix}$ where

N_(ZC) is a sequence length, and d_(u) is a cyclic shift corresponding to the random access sequence when a Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the third aspect, in a first possible implementation of the third aspect, in the case of ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1), the base station obtains the cyclic shift value C_(ν) by using formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1), the base station obtains the cyclic shift value C_(ν) by using formula (2);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the base station obtains the cyclic shift value C_(ν) by using formula (3).

With reference to the third aspect or the first possible implementation of the third aspect, in a second possible implementation of the third aspect, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (12) to (19); or in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${\frac{2}{7}N_{ZC}} < d_{u} \leq {\frac{N_{ZC} - N_{CS}}{3}.}$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19);

in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

start satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35); or in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (28) to (35).

According to a fourth aspect, an embodiment of the present application provides a random access sequence generation method, including:

selecting, by user equipment UE, a shift sequence number ν from a range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), where ν is an integer, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in a group, n_(group) ^(RA) is a quantity of groups, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in the last length that is insufficient for a group, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in first remaining sequence shifts, and

_(shift) ^(RA) is a quantity of UE candidate sequence shifts in second remaining sequence shifts;

obtaining, by the UE, a cyclic shift value C_(ν) according to the shift sequence number ν by using the following formula (1), formula (2), or formula (3): C _(ν) =d _(offset) +d _(start) └ν/n _(shift) ^(RA)┘+(ν mod n _(shift) ^(RA))N _(CS)  (1); C _(ν) =d _(offset) +d _(start)+(ν−n _(shift) ^(RA) n _(group) ^(RA) +n _(shift) ^(RA))N _(CS)  (2); C _(ν) =d _(offset) +

_(start)+(ν−n _(shift) ^(RA) n _(group) ^(RA) +n _(shift) ^(RA) +n _(shift) ^(RA))N _(CS)  (3), where

d_(offset) is a shift offset, d_(start) is a cyclic shift distance between neighboring groups, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in a group, N_(CS) is a quantity of cyclic shifts that are occupied by a user, d _(start) is a cyclic shift value of a first UE candidate sequence shift in the first remaining sequence shifts, and

is a cyclic shift value of a first UE candidate sequence shift in the second remaining sequence shifts; and

generating, by the UE, a random access sequence x_(u,C) _(ν) (n) according to the cyclic shift value C_(ν) by using the following formula (36): x _(u,C) _(ν) (n)=x _(u)((n+C _(ν))mod N _(ZC))  (36), where

N_(ZC) is a sequence length, and a ZC sequence whose root is u is defined as:

${{x_{u}(n)} = e^{{- j}\;\frac{\pi\;{un}{({n + 1})}}{N_{ZC}}}},$ 0≤n≤N_(ZC)−1, where

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (4) to (11); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35), where n _(shift) ^(RA)=└4d _(u) −N _(ZC) /N _(CS)┘  (4); d _(start)=4d _(u) −N _(ZC) +n _(shift) ^(RA) ·N _(CS)  (5); n _(group) ^(RA) =└d _(u) /d _(start)┘  (6); n _(shift) ^(RA)=max(└N _(ZC)−3d _(u) −n _(group) ^(RA) ·d _(start) /N _(CS)┘,0)  (7);

$\begin{matrix} {{{\overset{=}{n}}_{shift}^{RA} = \left\lfloor {{\min\left( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} \right)}\text{/}N_{CS}} \right\rfloor};} & (8) \\ {\mspace{79mu}{{{\overset{=}{d}}_{start} = {N_{ZC} - {3d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};}} & (9) \\ {{{\overset{\equiv}{n}}_{shift}^{RA} = {\left\lfloor {\left( {{\left( {1 - {\min\left( {1,{\overset{\_}{n}}_{shift}^{RA}} \right)}} \right)\left( {d_{u} - {n_{group}^{RA} \cdot d_{start}}} \right)} + {{\min\left( {1,{\overset{\_}{n}}_{shift}^{RA}} \right)}\left( {{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}} \right)}} \right)\text{/}N_{CS}} \right\rfloor - {\overset{=}{n}}_{shift}^{RA}}};} & (10) \\ {\mspace{79mu}{{{\overset{\equiv}{d}}_{start} = {N_{ZC} - {2d_{u}} + {n_{group}^{Ra} \cdot d_{start}} + {{\overset{=}{n}}_{shift}^{RA}N_{CS}}}};}} & (11) \\ {\mspace{79mu}{{n_{shift}^{RA} = \left\lfloor \frac{N_{ZC} - {3d_{u}}}{N_{CS}} \right\rfloor};}} & (12) \\ {\mspace{79mu}{{d_{start} = {N_{ZC} - {3d_{u}} + {n_{shift}^{RA} \cdot N_{CS}}}};}} & (13) \\ {\mspace{79mu}{{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor};}} & (14) \\ {\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{{4d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};}} & (15) \\ {{{\overset{=}{n}}_{shift}^{RA} = \left\lfloor {{\min\left( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{N_{ZC} - {3d_{u}} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} \right)}\text{/}N_{CS}} \right\rfloor};} & (16) \\ {\mspace{79mu}{{{\overset{=}{d}}_{start} = {d_{u} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};}} & (17) \\ {\mspace{79mu}{{{\overset{\equiv}{n}}_{shift}^{RA} = 0};}} & (18) \\ {\mspace{79mu}{{{\overset{\equiv}{d}}_{start} = 0};}} & (19) \\ {\mspace{79mu}{{n_{shift}^{RA} = \left\lfloor \frac{{3d_{u}} - N_{ZC}}{N_{CS}} \right\rfloor};}} & (20) \\ {\mspace{79mu}{{d_{start} = {{3d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};}} & (21) \\ {\mspace{79mu}{{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor};}} & (22) \\ {\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{N_{ZC} - {2d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};}} & (23) \\ {\mspace{79mu}{{{\overset{=}{n}}_{shift}^{RA} = 0};}} & (24) \\ {\mspace{79mu}{{{\overset{=}{d}}_{start} = 0};}} & (25) \\ {\mspace{79mu}{{{\overset{\equiv}{n}}_{shift}^{RA} = 0};}} & (26) \\ {\mspace{79mu}{{{\overset{\equiv}{d}}_{start} = 0};}} & (27) \\ {\mspace{79mu}{{n_{shift}^{RA} = \left\lfloor \frac{N_{ZC} - {2d_{u}}}{N_{CS}} \right\rfloor};}} & (28) \\ {\mspace{79mu}{{d_{start} = {{2\left( {N_{ZC} - {2d_{u}}} \right)} + {n_{shift}^{RA} \cdot N_{CS}}}};}} & (29) \\ {\mspace{79mu}{{n_{group}^{RA} = \left\lfloor \frac{N_{ZC} - d_{u}}{d_{start}} \right\rfloor};}} & (30) \\ {\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{{3d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};}} & (31) \\ {\mspace{79mu}{{{\overset{=}{n}}_{shift}^{RA} = 0};}} & (32) \\ {\mspace{79mu}{{{\overset{=}{d}}_{start} = 0};}} & (33) \\ {\mspace{79mu}{{{\overset{\equiv}{n}}_{shift}^{RA} = 0};}} & (34) \\ {\mspace{79mu}{{{\overset{\equiv}{d}}_{start} = 0},}} & (35) \end{matrix}$ where

d_(u) is a cyclic shift corresponding to the random access sequence when a Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the fourth aspect, in a first possible implementation of the fourth aspect, in the case of ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1), the UE obtains the cyclic shift value C_(ν) by using formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1), the UE obtains the cyclic shift value C_(ν) by using formula (2);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the UE obtains the cyclic shift value C_(ν) by using formula (3).

With reference to the fourth aspect or the first possible implementation of the fourth aspect, in a second possible implementation of the fourth aspect, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19);

in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35); or in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (28) to (35).

According to a fifth aspect, an embodiment of the present application provides a base station, including:

a generation module, configured to generate notification signaling, where the notification signaling includes indication information, the indication information is used to instruct user equipment UE to select a shift sequence number from a range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the shift sequence number is an integer, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in a group, n_(group) ^(RA) is a quantity of groups, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in the last length that is insufficient for a group, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in first remaining sequence shifts, and

_(shift) ^(RA) is a quantity of UE candidate sequence shifts in second remaining sequence shifts; and

a sending module, configured to send the notification signaling to the UE, so that the UE generates a random access sequence according to the indication information.

With reference to the fifth aspect, in a first possible implementation of the fifth aspect, the base station further includes:

a shift sequence number determining module, configured to select a shift sequence number from the range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1);

a cyclic shift value determining module, configured to obtain a cyclic shift value according to the shift sequence number; and

a random access sequence detection module, configured to: generate a detection sequence according to the cyclic shift value, and detect, by using the detection sequence, the random access sequence sent by the UE, where the random access sequence is generated by the UE according to the indication information.

With reference to the first possible implementation of the fifth aspect, in a second possible implementation of the fifth aspect, the cyclic shift value determining module is specifically configured to:

obtain the cyclic shift value C_(ν) according to the shift sequence number ν by using the following formula (1), formula (2), or formula (3): C _(ν) =d _(offset) +d _(start) └ν/n _(shift) ^(RA)┘+(ν mod n _(shift) ^(RA))N _(CS)  (1); C _(ν) =d _(offset) +d _(start)+(ν−n _(shift) ^(RA) n _(group) ^(RA) +n _(shift) ^(RA))N _(CS)  (2); C _(ν) =d _(offset) +

_(start)+(ν−n _(shift) ^(RA) n _(group) ^(RA) +n _(shift) ^(RA) +n _(shift) ^(RA))N _(CS)  (3), where

d_(offset) is a shift offset, d_(start) is a cyclic shift distance between neighboring groups, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in a group, N_(CS) is a quantity of cyclic shifts that are occupied by a user, d _(start) is a cyclic shift value of a first UE candidate sequence shift in the first remaining sequence shifts, and

is a cyclic shift value of a first UE candidate sequence shift in the second remaining sequence shifts.

With reference to the second possible implementation of the first aspect, in a third possible implementation of the first aspect, in the case of ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1), the cyclic shift value determining module obtains the cyclic shift value C_(ν) by using formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1), the cyclic shift value determining module obtains the cyclic shift value C_(ν) by using formula (2);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the cyclic shift value determining module obtains the cyclic shift value C_(ν) by using formula (3).

With reference to the second or the third possible implementation of the fifth aspect, in a fourth possible implementation of the fifth aspect, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), where

formulas (4) to (11) are respectively:

$\begin{matrix} {\mspace{79mu}{{n_{shift}^{RA} = \left\lfloor \frac{{4d_{u}} - N_{ZC}}{N_{CS}} \right\rfloor};}} & (4) \\ {\mspace{79mu}{{d_{start} = {{4d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};}} & (5) \\ {\mspace{79mu}{{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor};}} & (6) \\ {\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{N_{ZC} - {3d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};}} & (7) \\ {\mspace{79mu}{{{\overset{=}{n}}_{shift}^{RA} = \left\lfloor {{\min\left( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} \right)}\text{/}N_{CS}} \right\rfloor};}} & (8) \\ {\mspace{79mu}{{{\overset{=}{d}}_{start} = {N_{ZC} - {3d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};}} & (9) \\ {{{\overset{\equiv}{n}}_{shift}^{RA} = {\left\lfloor {\left( {{\left( {1 - {\min\left( {1,{\overset{\_}{n}}_{shift}^{RA}} \right)}} \right)\left( {d_{u} - {n_{group}^{RA} \cdot d_{start}}} \right)} + {{\min\left( {1,{\overset{\_}{n}}_{shift}^{RA}} \right)}\left( {{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}} \right)}} \right)\text{/}N_{CS}} \right\rfloor - {\overset{=}{n}}_{shift}^{RA}}};} & (10) \\ {\mspace{79mu}{{{\overset{\equiv}{d}}_{start} = {N_{ZC} - {2d_{u}} + {n_{group}^{Ra} \cdot d_{start}} + \;{{\overset{=}{n}}_{shift}^{RA}N_{CS}}}},}} & (11) \end{matrix}$ where

d_(u) is a cyclic shift corresponding to the random access sequence when a Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the second or the third possible implementation of the fifth aspect, in a fifth possible implementation of the fifth aspect, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19), where

formulas (12) to (19) are respectively:

$\begin{matrix} {{n_{shift}^{RA} = \left\lfloor \frac{N_{ZC} - {3d_{u}}}{N_{CS}} \right\rfloor};} & (12) \\ {{d_{start} = {N_{ZC} - {3d_{u}} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (13) \\ {{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor};} & (14) \\ {{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{{4d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};} & (15) \\ {{{\overset{=}{n}}_{shift}^{RA} = \left\lfloor {{\min\left( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{N_{ZC} - {3d_{u}} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} \right)}\text{/}N_{CS}} \right\rfloor};} & (16) \\ {{{\overset{=}{d}}_{start} = {d_{u} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};} & (17) \\ {{{\overset{\equiv}{n}}_{shift}^{RA} = 0};} & (18) \\ {{{\overset{\equiv}{d}}_{start} = 0},} & (19) \end{matrix}$ where

d_(u) is a cyclic shift corresponding to the random access sequence when a Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the second or the third possible implementation of the fifth aspect, in a sixth possible implementation of the fifth aspect, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), where

formulas (20) to (27) are respectively:

$\begin{matrix} {{n_{shift}^{RA} = \left\lfloor \frac{{3d_{u}} - N_{ZC}}{N_{CS}} \right\rfloor};} & (20) \\ {{d_{start} = {{3d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (21) \\ {{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor};} & (22) \\ {{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{N_{ZC} - {2d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};} & (23) \\ {{{\overset{=}{n}}_{shift}^{RA} = 0};} & (24) \\ {{{\overset{=}{d}}_{start} = 0};} & (25) \\ {{{\overset{\equiv}{n}}_{shift}^{RA} = 0};} & (26) \\ {{{\overset{\equiv}{d}}_{start} = 0},} & (27) \end{matrix}$ where

d_(u) is a cyclic shift corresponding to the random access sequence when a Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the second or the third possible implementation of the fifth aspect, in a seventh possible implementation of the fifth aspect, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35), where

formulas (28) to (35) are respectively:

$\begin{matrix} {{n_{shift}^{RA} = \left\lfloor \frac{N_{ZC} - {2d_{u}}}{N_{CS}} \right\rfloor};} & (28) \\ {{d_{start} = {{2\left( {N_{ZC} - {2d_{u}}} \right)} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (29) \\ {{n_{group}^{RA} = \left\lfloor \frac{N_{ZC} - d_{u}}{d_{start}} \right\rfloor};} & (30) \\ {{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{{3d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};} & (31) \\ {{{\overset{=}{n}}_{shift}^{RA} = 0};} & (32) \\ {{{\overset{=}{d}}_{start} = 0};} & (33) \\ {{{\overset{\equiv}{n}}_{shift}^{RA} = 0};} & (34) \\ {{{\overset{\equiv}{d}}_{start} = 0},} & (35) \end{matrix}$ where

d_(u) is a cyclic shift corresponding to the random access sequence when a Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to any one of the fourth to the seventh possible implementations of the fifth aspect, in an eighth possible implementation of the fifth aspect, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (12) to (19);

in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35); or in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

According to a sixth aspect, an embodiment of the present application provides user equipment UE, including:

a receiving module, configured to receive notification signaling from a base station, where the notification signaling includes indication information, the indication information is used to instruct the UE to select a shift sequence number from a range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the shift sequence number is an integer, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in a group, n_(group) ^(RA) is a quantity of groups, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in the last length that is insufficient for a group, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in first remaining sequence shifts, and

_(shift) ^(RA) is a quantity of UE candidate sequence shifts in second remaining sequence shifts;

a shift sequence number determining module, configured to select a shift sequence number from the range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1) according to the notification signaling;

a cyclic shift value determining module, configured to obtain a cyclic shift value according to the shift sequence number; and

a random access sequence generation module, configured to generate a random access sequence according to the cyclic shift value.

With reference to the sixth aspect, in a first possible implementation of the sixth aspect, the cyclic shift value determining module is specifically configured to:

obtain the cyclic shift value C_(ν) according to the shift sequence number ν by using the following formula (1), formula (2), or formula (3): C _(ν) =d _(offset) +d _(start) └ν/n _(shift) ^(RA)┘+(ν mod n _(shift) ^(RA))N _(CS)  (1); C _(ν) =d _(offset) +d _(start)+(ν−n _(shift) ^(RA) n _(group) ^(RA) +n _(shift) ^(RA))N _(CS)  (2); C _(ν) =d _(offset) +

_(start)+(ν−n _(shift) ^(RA) n _(group) ^(RA) +n _(shift) ^(RA) +n _(shift) ^(RA))N _(CS)  (3), where

d_(offset) is a shift offset, d_(start) is a cyclic shift distance between neighboring groups, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in a group, N_(CS) is a quantity of cyclic shifts that are occupied by a user, d _(start) is a cyclic shift value of a first UE candidate sequence shift in the first remaining sequence shifts, and

is a cyclic shift value of a first UE candidate sequence shift in the second remaining sequence shifts.

With reference to the first possible implementation of the sixth aspect, in a second possible implementation of the sixth aspect, in the case of ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1), the cyclic shift value determining module obtains the cyclic shift value C_(ν) by using formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1), the cyclic shift value determining module obtains the cyclic shift value C_(ν) by using formula (2);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the cyclic shift value determining module obtains the cyclic shift value C_(ν) by using formula (3).

With reference to the first or the second possible implementation of the sixth aspect, in a third possible implementation of the sixth aspect, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), where

formulas (4) to (11) are respectively:

$\begin{matrix} {\mspace{79mu}{{n_{shift}^{RA} = \left\lfloor \frac{{4d_{u}} - N_{ZC}}{N_{CS}} \right\rfloor};}} & (4) \\ {\mspace{79mu}{{d_{start} = {{4d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};}} & (5) \\ {\mspace{79mu}{{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor};}} & (6) \\ {\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{N_{ZC} - {3d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};}} & (7) \\ {{{\overset{=}{n}}_{shift}^{RA} = \left\lfloor {{\min\left( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} \right)}\text{/}N_{CS}} \right\rfloor};} & (8) \\ {\mspace{79mu}{{{\overset{=}{d}}_{start} = {N_{ZC} - {3d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};}} & (9) \\ {{{\overset{\equiv}{n}}_{shift}^{RA} = {\left\lfloor {\left( {{\left( {1 - {\min\left( {1,{\overset{\_}{n}}_{shift}^{RA}} \right)}} \right)\left( {d_{u} - {n_{group}^{RA} \cdot d_{start}}} \right)} + {{\min\left( {1,{\overset{\_}{n}}_{shift}^{RA}} \right)}\left( {{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}} \right)}} \right)\text{/}N_{CS}} \right\rfloor - {\overset{=}{n}}_{shift}^{RA}}};} & (10) \\ {\mspace{79mu}{{{\overset{\equiv}{d}}_{start} = {N_{ZC} - {2d_{u}} + {n_{group}^{Ra} \cdot d_{start}} + {{\overset{=}{n}}_{shift}^{RA}N_{CS}}}},}} & (11) \end{matrix}$ where

d_(u) is a cyclic shift corresponding to the random access sequence when a Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the first or the second possible implementation of the sixth aspect, in a fourth possible implementation of the sixth aspect, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19), where

formulas (12) to (19) are respectively:

$\begin{matrix} {{n_{shift}^{RA} = \left\lfloor \frac{N_{ZC} - {3d_{u}}}{N_{CS}} \right\rfloor};} & (12) \\ {{d_{start} = {N_{ZC} - {3d_{u}} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (13) \\ {{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor};} & (14) \\ {{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{{4d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};} & (15) \\ {{{\overset{=}{n}}_{shift}^{RA} = \left\lfloor {{\min\left( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{N_{ZC} - {3d_{u}} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} \right)}\text{/}N_{CS}} \right\rfloor};} & (16) \\ {{{\overset{=}{d}}_{start} = {d_{u} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};} & (17) \\ {{{\overset{\equiv}{n}}_{shift}^{RA} = 0};} & (18) \\ {{{\overset{\equiv}{d}}_{start} = 0},} & (19) \end{matrix}$ where

d_(u) is a cyclic shift corresponding to the random access sequence when a Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the first or the second possible implementation of the sixth aspect, in a fifth possible implementation of the sixth aspect, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), where

formulas (20) to (27) are respectively:

$\begin{matrix} {{n_{shift}^{RA} = \left\lfloor \frac{{3d_{u}} - N_{ZC}}{N_{CS}} \right\rfloor};} & (20) \\ {{d_{start} = {{3d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (21) \\ {{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor};} & (22) \\ {{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{N_{ZC} - {2d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};} & (23) \\ {{{\overset{=}{n}}_{shift}^{RA} = 0};} & (24) \\ {{{\overset{=}{d}}_{start} = 0};} & (25) \\ {{{\overset{\equiv}{n}}_{shift}^{RA} = 0};} & (26) \\ {{{\overset{\equiv}{d}}_{start} = 0},} & (27) \end{matrix}$ where

d_(u) is a cyclic shift corresponding to the random access sequence when a Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the first or the second possible implementation of the sixth aspect, in a sixth possible implementation of the sixth aspect, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35), where

formulas (28) to (35) are respectively:

$\begin{matrix} {{n_{shift}^{RA} = \left\lfloor \frac{N_{ZC} - {2d_{u}}}{N_{CS}} \right\rfloor};} & (28) \\ {{d_{start} = {{2\left( {N_{ZC} - {2d_{u}}} \right)} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (29) \\ {{n_{group}^{RA} = \left\lfloor \frac{N_{ZC} - d_{u}}{d_{start}} \right\rfloor};} & (30) \\ {{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{{3d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};} & (31) \\ {{{\overset{=}{n}}_{shift}^{RA} = 0};} & (32) \\ {{{\overset{=}{d}}_{start} = 0};} & (33) \\ {{{\overset{\equiv}{n}}_{shift}^{RA} = 0};} & (34) \\ {{{\overset{\equiv}{d}}_{start} = 0},} & (35) \end{matrix}$ where

d_(u) is a cyclic shift corresponding to the random access sequence when a Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to any one of the third to the sixth possible implementations of the sixth aspect, in a seventh possible implementation of the sixth aspect, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (12) to (19);

in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35); or in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

With reference to any one of the sixth aspect, or the first to the seventh possible implementations of the sixth aspect, in an eighth possible implementation of the sixth aspect, the random access sequence generation module is specifically configured to:

generate the random access sequence x_(u,C) _(ν) (n) according to the cyclic shift value C_(ν) by using the following formula (36): x _(u,C) _(ν) (n)=x _(u)((n+C _(ν))mod N _(ZC))  (36), where

N_(ZC) is a sequence length, and a ZC sequence whose root is u is defined as:

${{x_{u}(n)}e^{{- j}\;\frac{\pi\;{un}{({n + 1})}}{N_{ZC}}}},$ 0≤n≤N_(ZC)−1.

According to a seventh aspect, an embodiment of the present application provides a base station, including:

a shift sequence number determining module, configured to select a shift sequence number ν from a range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), where ν is an integer, n_(shift) ^(RA) is a quantity of user equipment UE candidate sequence shifts in a group, n_(group) ^(RA) is a quantity of groups, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in the last length that is insufficient for a group, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in first remaining sequence shifts, and

_(shift) ^(RA) is a quantity of UE candidate sequence shifts in second remaining sequence shifts; and

a cyclic shift value determining module, configured to obtain a cyclic shift value C_(ν) according to the shift sequence number ν by using the following formula (1), formula (2), or formula (3): C _(ν) =d _(offset) +d _(start) └ν/n _(shift) ^(RA)┘+(ν mod n _(shift) ^(RA))N _(CS)  (1); C _(ν) =d _(offset) +d _(start)+(ν−n _(shift) ^(RA) n _(group) ^(RA) +n _(shift) ^(RA))N _(CS)  (2); C _(ν) =d _(offset) +

_(start)+(ν−n _(shift) ^(RA) n _(group) ^(RA) +n _(shift) ^(RA) +n _(shift) ^(RA))N _(CS)  (3), where

d_(offset) is a shift offset, d_(start) is a cyclic shift distance between neighboring groups, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in a group, N_(CS) is a quantity of cyclic shifts that are occupied by a user, d _(start) is a cyclic shift value of a first UE candidate sequence shift in the first remaining sequence shifts, and

is a cyclic shift value of a first UE candidate sequence shift in the second remaining sequence shifts, where

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (4) to (11); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35), where

$\begin{matrix} {\mspace{79mu}{{n_{shift}^{RA} = \left\lfloor \frac{{4d_{u}} - N_{ZC}}{N_{CS}} \right\rfloor};}} & (4) \\ {\mspace{79mu}{{d_{start} = {{4d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};}} & (5) \\ {\mspace{79mu}{{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor};}} & (6) \\ {\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{N_{ZC} - {3d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};}} & (7) \\ {{{\overset{=}{n}}_{shift}^{RA} = \left\lfloor {{\min\left( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} \right)}\text{/}N_{CS}} \right\rfloor};} & (8) \\ {\mspace{79mu}{{{\overset{=}{d}}_{start} = {N_{ZC} - {3d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};}} & (9) \\ {{{\overset{\equiv}{n}}_{shift}^{RA} = {\left\lfloor {\left( {{\left( {1 - {\min\left( {1,{\overset{\_}{n}}_{shift}^{RA}} \right)}} \right)\left( {d_{u} - {n_{group}^{RA} \cdot d_{start}}} \right)} + {{\min\left( {1,{\overset{\_}{n}}_{shift}^{RA}} \right)}\left( {{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}} \right)}} \right)\text{/}N_{CS}} \right\rfloor - {\overset{=}{n}}_{shift}^{RA}}};} & (10) \\ {\mspace{79mu}{{{\overset{\equiv}{d}}_{start} = {N_{ZC} - {2d_{u}} + {n_{group}^{Ra} \cdot d_{start}} + {{\overset{=}{n}}_{shift}^{RA}N_{CS}}}};}} & (11) \\ {\mspace{79mu}{{n_{shift}^{RA} = \left\lfloor \frac{N_{ZC} - {3d_{u}}}{N_{CS}} \right\rfloor};}} & (12) \\ {\mspace{79mu}{{d_{start} = {N_{ZC} - {3d_{u}} + {n_{shift}^{RA} \cdot N_{CS}}}};}} & (13) \\ {\mspace{79mu}{{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor};}} & (14) \\ {\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{{4d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};}} & (15) \\ {{{\overset{=}{n}}_{shift}^{RA} = \left\lfloor {{\min\left( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{N_{ZC} - {3d_{u}} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} \right)}\text{/}N_{CS}} \right\rfloor};} & (16) \\ {\mspace{79mu}{{{\overset{=}{d}}_{start} = {d_{u} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};}} & (17) \\ {\mspace{79mu}{{{\overset{\equiv}{n}}_{shift}^{RA} = 0};}} & (18) \\ {\mspace{79mu}{{{\overset{\equiv}{d}}_{start} = 0};}} & (19) \\ {\mspace{79mu}{{n_{shift}^{RA} = \left\lfloor \frac{{3d_{u}} - N_{ZC}}{N_{CS}} \right\rfloor};}} & (20) \\ {\mspace{79mu}{{d_{start} = {{3d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};}} & (21) \\ {\mspace{79mu}{{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor};}} & (22) \\ {\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{N_{ZC} - {2d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};}} & (23) \\ {\mspace{79mu}{{{\overset{=}{n}}_{shift}^{RA} = 0};}} & (24) \\ {\mspace{79mu}{{{\overset{=}{d}}_{start} = 0};}} & (25) \\ {\mspace{79mu}{{{\overset{\equiv}{n}}_{shift}^{RA} = 0};}} & (26) \\ {\mspace{79mu}{{{\overset{\equiv}{d}}_{start} = 0};}} & (27) \\ {\mspace{79mu}{{n_{shift}^{RA} = \left\lfloor \frac{N_{ZC} - {2d_{u}}}{N_{CS}} \right\rfloor};}} & (28) \\ {\mspace{79mu}{{d_{start} = {{2\left( {N_{ZC} - {2d_{u}}} \right)} + {n_{shift}^{RA} \cdot N_{CS}}}};}} & (29) \\ {\mspace{79mu}{{n_{group}^{RA} = \left\lfloor \frac{N_{ZC} - d_{u}}{d_{start}} \right\rfloor};}} & (30) \\ {\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{{3d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};}} & (31) \\ {\mspace{79mu}{{{\overset{=}{n}}_{shift}^{RA} = 0};}} & (32) \\ {\mspace{79mu}{{{\overset{=}{d}}_{start} = 0};}} & (33) \\ {\mspace{79mu}{{{\overset{\equiv}{n}}_{shift}^{RA} = 0};}} & (34) \\ {\mspace{79mu}{{{\overset{\equiv}{d}}_{start} = 0},}} & (35) \end{matrix}$

N_(ZC) is a sequence length, and d_(u) is a cyclic shift corresponding to the random access sequence when a Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the seventh aspect, in a first possible implementation of the seventh aspect, in the case of ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1), the cyclic shift value determining module obtains the cyclic shift value C_(ν) by using formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1), the cyclic shift value determining module obtains the cyclic shift value C_(ν) by using formula (2);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the cyclic shift value determining module obtains the cyclic shift value C_(ν) by using formula (3).

With reference to the seventh aspect or the first possible implementation of the seventh aspect, in a second possible implementation of the seventh aspect, in the case of

${\frac{N_{ZC} + N_{C}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{C}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or in the case of

$\mspace{11mu}{{\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},}$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (12) to (19);

in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35); or in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (28) to (35).

According to an eighth aspect, an embodiment of the present application provides user equipment UE, including:

a shift sequence number determining module, configured to select a shift sequence number ν from a range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), where ν is an integer, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in a group, n_(group) ^(RA) is a quantity of groups, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in the last length that is insufficient for a group, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in first remaining sequence shifts, and

_(shift) ^(RA) is a quantity of UE candidate sequence shifts in second remaining sequence shifts;

a cyclic shift value determining module, configured to obtain a cyclic shift value C_(ν) according to the shift sequence number ν by using the following formula (1), formula (2), or formula (3): C _(ν) =d _(offset) +d _(start) └ν/n _(shift) ^(RA)┘+(ν mod n _(shift) ^(RA))N _(CS)  (1); C _(ν) =d _(offset) +d _(start)+(ν−n _(shift) ^(RA) n _(group) ^(RA) +n _(shift) ^(RA))N _(CS)  (2); C _(ν) =d _(offset) +

_(start)+(ν−n _(shift) ^(RA) n _(group) ^(RA) +n _(shift) ^(RA) +n _(shift) ^(RA))N _(CS)  (3), where

d_(offset) is a shift offset, d_(start) is a cyclic shift distance between neighboring groups, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in a group, N_(CS) is a quantity of cyclic shifts that are occupied by a user, d _(start) is a cyclic shift value of a first UE candidate sequence shift in the first remaining sequence shifts, and

is a cyclic shift value of a first UE candidate sequence shift in the second remaining sequence shifts; and

a random access sequence generation module, configured to generate a random access sequence x_(u,C) _(ν) (n) according to the cyclic shift value C_(ν) by using the following formula (36): x _(u,C) _(ν) (n)=x _(u)((n+C _(ν))mod N _(ZC))  (36), where

N_(ZC) is a sequence length, and a ZC sequence whose root is u is defined as:

${{x_{u}(n)} = e^{{- j}\frac{\pi\;{un}\mspace{11mu}{({n + 1})}}{N_{ZC}}}},$ 0≤n≤N_(ZC)−1, where

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (4) to (11); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35), where

$\begin{matrix} {{n_{shift}^{RA} = \left\lfloor \frac{{4d_{u}} - N_{ZC}}{N_{CS}} \right\rfloor};} & (4) \\ {{d_{start} = {{4d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (5) \\ {{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor};} & (6) \\ {{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{N_{ZC} - {3d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};} & (7) \\ {{{\overset{\overset{\_}{\_}}{n}}_{shift}^{RA} = \left\lfloor {{\min\left( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} \right)}\text{/}N_{CS}} \right\rfloor};} & (8) \\ {{{\overset{\overset{\_}{\_}}{d}}_{start} = {N_{ZC} - {3d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};} & (9) \\ {{\overset{\overset{\overset{\_}{\_}}{\_}}{n}}_{shift}^{RA} = \left\lfloor {{\left( {{\left( {1 - {\min\left( {1,{\overset{\_}{n}}_{shift}^{RA}} \right)}} \right)\left( {d_{u} - {n_{group}^{RA} \cdot d_{start}}} \right)} + {{\min\left( {1,{{\overset{\_}{n}}_{shift}^{RA}\left( {{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}} \right)}} \right)}\text{/}N_{CS}}} \right\rfloor - {\overset{\overset{\_}{\_}}{n}}_{shift}^{RA}};} \right.} & (10) \\ {{{\overset{\overset{\overset{\_}{\_}}{\_}}{d}}_{start} = {N_{ZC} - {2d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\overset{\_}{\_}}{n}}_{shift}^{RA}N_{CS}}}};} & (11) \\ {{n_{shift}^{RA} = \left\lfloor \frac{N_{ZC} - {3d_{u}}}{N_{CS}} \right\rfloor};} & (12) \\ {{d_{start} = {N_{ZC} - {3d_{u}} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (13) \\ {{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor};} & (14) \\ {{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{{4d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};} & (15) \\ {{{\overset{\overset{\_}{\_}}{n}}_{shift}^{RA} = \left\lfloor {{\min\left( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{N_{ZC} - {3d_{u}} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} \right)}\text{/}N_{CS}} \right\rfloor};} & (16) \\ {{{\overset{\overset{\_}{\_}}{d}}_{start} = {d_{u} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};} & (17) \\ {{{\overset{\overset{\overset{\_}{\_}}{\_}}{n}}_{shift}^{RA} = 0};} & (18) \\ {{{\overset{\overset{\overset{\_}{\_}}{\_}}{d}}_{start} = 0};} & (19) \\ {{n_{shift}^{RA} = \left\lfloor \frac{{3d_{u}} - N_{ZC}}{N_{CS}} \right\rfloor};} & (20) \\ {{d_{start} = {{3d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (21) \\ {{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor};} & (22) \\ {{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{N_{ZC} - {2d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};} & (23) \\ {{{\overset{\overset{\_}{\_}}{n}}_{shift}^{RA} = 0};} & (24) \\ {{{\overset{\overset{\_}{\_}}{d}}_{start} = 0};} & (25) \\ {{{\overset{\overset{\overset{\_}{\_}}{\_}}{n}}_{shift}^{RA} = 0};} & (26) \\ {{{\overset{\overset{\overset{\_}{\_}}{\_}}{d}}_{start} = 0};} & (27) \\ {{n_{shift}^{RA} = \left\lfloor \frac{N_{ZC} - {2d_{u}}}{N_{CS}} \right\rfloor};} & (28) \\ {{d_{start} = {{2\left( {N_{ZC} - {2d_{u}}} \right)} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (29) \\ {{n_{group}^{RA} = \left\lfloor \frac{N_{ZC} - d_{u}}{d_{start}} \right\rfloor};} & (30) \\ {{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{{3d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};} & (31) \\ {{{\overset{\overset{\_}{\_}}{n}}_{shift}^{RA} = 0};} & (32) \\ {{{\overset{\overset{\_}{\_}}{d}}_{start} = 0};} & (33) \\ {{{\overset{\overset{\overset{\_}{\_}}{\_}}{n}}_{shift}^{RA} = 0};} & (34) \\ {{{\overset{\overset{\overset{\_}{\_}}{\_}}{d}}_{start} = 0},} & (35) \end{matrix}$ where

d_(u) is a cyclic shift corresponding to the random access sequence when a Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the eighth aspect, in a first possible implementation of the eighth aspect, in the case of ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1), the cyclic shift value determining module obtains the cyclic shift value C_(ν) by using formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1), the cyclic shift value determining module obtains the cyclic shift value C_(ν) by using formula (2);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the cyclic shift value determining module obtains the cyclic shift value C_(ν) by using formula (3).

With reference to the eighth aspect or the first possible implementation of the eighth aspect, in a second possible implementation of the eighth aspect, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (12) to (19); or in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19);

in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35); or in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (20) to (27), in the case of

${\frac{2\; N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (28) to (35).

According to a ninth aspect, an embodiment of the present application provides a random access sequence generation system, including: the base station described in any one of the fifth aspect, or the first to the eighth possible implementations of the fifth aspect, and the user equipment UE described in any one of the sixth aspect, or the first to the eighth possible implementations of the sixth aspect.

According to a tenth aspect, an embodiment of the present application provides a random access sequence generation system, including: the base station described in any one of the seventh aspect, or the first to the second possible implementations of the seventh aspect, and the user equipment UE described in any one of the eighth aspect, or the first to the second possible implementations of the eighth aspect.

According to the random access sequence generation method, the device, and the system in the embodiments of the present application, the random access sequence generation method includes: generating, by the base station, the notification signaling, where the notification signaling includes the indication information, the indication information is used to instruct the user equipment UE to select the shift sequence number from the range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the shift sequence number is an integer, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in a group, n_(group) ^(RA) is a quantity of groups, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in the last length that is insufficient for a group, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in first remaining sequence shifts, and

_(shift) ^(RA) is the quantity of UE candidate sequence shifts in the second remaining sequence shifts; and sending, by the base station, the notification signaling to the UE, so that the UE generates the random access sequence according to the indication information.

BRIEF DESCRIPTION OF DRAWINGS

To describe the technical solutions in the embodiments of the present application more clearly, the following briefly describes the accompanying drawings required for describing the embodiments. Apparently, the accompanying drawings in the following description show some embodiments of the present application, and persons of ordinary skill in the art may still derive other drawings from these accompanying drawings without creative efforts.

FIG. 1 is a flowchart of Embodiment 1 of a random access sequence generation method according to the present application;

FIG. 2 is a flowchart of Embodiment 2 of a random access sequence generation method according to the present application;

FIG. 3 is a schematic diagram of scenario 1 according to an embodiment of the present application;

FIG. 4 is a schematic diagram of scenario 2 according to an embodiment of the present application;

FIG. 5 is a schematic diagram of scenario 3 according to an embodiment of the present application;

FIG. 6 is a schematic diagram of scenario 4 according to an embodiment of the present application;

FIG. 7 is a schematic diagram of scenario 5 according to an embodiment of the present application;

FIG. 8 is a schematic diagram of scenario 6 according to an embodiment of the present application;

FIG. 9 is a schematic diagram of scenario 7 according to an embodiment of the present application;

FIG. 10 is a flowchart of Embodiment 3 of a random access sequence generation method according to the present application;

FIG. 11 is a flowchart of Embodiment 5 of a random access sequence generation method according to the present application;

FIG. 12 is a flowchart of Embodiment 6 of a random access sequence generation method according to the present application;

FIG. 13 is a schematic structural diagram of Embodiment 1 of a base station according to the present application;

FIG. 14 is a schematic structural diagram of Embodiment 2 of a base station according to the present application;

FIG. 15 is a schematic structural diagram of Embodiment 1 of user equipment according to the present application;

FIG. 16 is a schematic structural diagram of Embodiment 3 of a base station according to the present application;

FIG. 17 is a schematic structural diagram of Embodiment 3 of user equipment according to the present application;

FIG. 18 is a schematic structural diagram of Embodiment 4 of a base station according to the present application;

FIG. 19 is a schematic structural diagram of Embodiment 4 of user equipment according to the present application; and

FIG. 20 is a schematic structural diagram of Embodiment 5 of a base station according to the present application.

DESCRIPTION OF EMBODIMENTS

To make the objectives, technical solutions, and advantages of the embodiments of the present application clearer, the following clearly describes the technical solutions in the embodiments of the present application with reference to the accompanying drawings in the embodiments of the present application. Apparently, the described embodiments are some but not all of the embodiments of the present application. All other embodiments obtained by persons of ordinary skill in the art based on the embodiments of the present application without creative efforts shall fall within the protection scope of the present application.

FIG. 1 is a flowchart of Embodiment 1 of a random access sequence generation method according to the present application. As shown in FIG. 1, the method in this embodiment may include:

Step 101: A base station generates notification signaling, where the notification signaling includes indication information, the indication information is used to instruct user equipment UE to select a shift sequence number from a range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the shift sequence number is an integer, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in a group, n_(group) ^(RA) is a quantity of groups, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in the last length that is insufficient for a group, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in first remaining sequence shifts, and

_(shift) ^(RA) is a quantity of UE candidate sequence shifts in second remaining sequence shifts.

It should be noted that, a “group” in the present application is a sequence shift group; n_(group) ^(RA) indicates a quantity of groups obtained after sequence shifts are grouped; n_(shift) ^(RA) indicates a quantity of UEs that can be distinguished in a sequence shift group after sequence shifts are grouped; n _(shift) ^(RA) indicates a quantity of UEs that are further distinguished in a sequence shift in a remaining length that is insufficient for a group after sequence shifts are grouped; n _(shift) ^(RA) and

_(shift) ^(RA) indicate quantities of UEs that can be distinguished in remaining discrete sequence shifts of all sequence shifts other than sequence shifts that are definitely occupied by n_(shift) ^(RA), n_(group) ^(RA), and n _(shift) ^(RA).

Step 102: The base station sends the notification signaling to the UE, so that the UE generates a random access sequence according to the indication information.

In the conventional art, the UE selects a shift sequence number from the range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1). In the present application, the base station instructs, by using the notification signaling, the UE to select a shift sequence number from the range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1).

In the conventional art, shift sequences are grouped to determine three parameters: a quantity (n_(group) ^(RA)) of groups, a quantity (n_(shift) ^(RA)) of UE candidate sequence shifts in a group, and a quantity (n _(shift) ^(RA)) of UE candidate sequence shifts in the last length that is insufficient for a group; and a shift sequence number is selected from an interval that is determined according to the three parameters. As can be learned, in the conventional art, during determining of a range from which a shift sequence number is selected, a quantity of UEs that can be distinguished is considered from only a perspective of a group, and other remaining discrete shift sequences obtained after grouping are not considered. In the present application, after a quantity of UEs that can be distinguished is considered from a perspective of a group, quantities of UEs that can be further distinguished in other remaining discrete shift sequences obtained after grouping, that is, a quantity (n _(shift) ^(RA)) of UE candidate sequence shifts in first remaining sequence shifts and a quantity (

) of UE candidate sequence shifts in second remaining sequence shifts, are further considered; and the UE is instructed, by using the notification signaling, to select a shift sequence number from the range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), thereby expanding a range from which a shift sequence number is selected.

FIG. 2 is a flowchart of Embodiment 2 of a random access sequence generation method according to the present application. As shown in FIG. 2, optionally, after step 102, the method may further include:

Step 201: The base station selects a shift sequence number from the range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1).

Optionally, because the base station cannot learn a shift sequence number that is used by the UE when the UE sends the random access sequence, when the base station detects the random access sequence sent by the UE, the base station sequentially chooses to traverse each shift sequence number in the range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1). Alternatively, the base station sequentially chooses to traverse each shift sequence number in a range of 0 to X. X is an integer less than (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1).

Step 202: The base station obtains a cyclic shift value according to the shift sequence number.

Optionally, the base station obtains the cyclic shift value C_(ν) of the UE according to the shift sequence number ν by using the following formula (1), formula (2), or formula (3): C _(ν) =d _(offset) +d _(start) └ν/n _(shift) ^(RA)┘+(ν mod n _(shift) ^(RA))N _(CS)  (1); C _(ν) =d _(offset) +d _(start)+(ν−n _(shift) ^(RA) n _(group) ^(RA) +n _(shift) ^(RA))N _(CS)  (2); C _(ν) =d _(offset) +

_(start)+(ν−n _(shift) ^(RA) n _(group) ^(RA) +n _(shift) ^(RA) +n _(shift) ^(RA))N _(CS)  (3), where

d_(offset) is a shift offset, d_(start) is a cyclic shift distance between neighboring groups, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in a group, N_(CS) is a quantity of cyclic shifts that are occupied by a user, d _(start) is a cyclic shift value of a first UE candidate sequence shift in the first remaining sequence shifts, and

is a cyclic shift value of a first UE candidate sequence shift in the second remaining sequence shifts.

It should be noted that, d_(offset) is an integer (which is usually a constant integer), and d_(offset) used on a base station side and d_(offset) used on a UE side need to be the same. Optionally, that d_(offset) used on the base station side and d_(offset) used on the UE side have a same value may be implemented by means of agreement in advance. For example, d_(offset)=0.

It should be noted that, in the present application, └Y┘ indicates rounded-down of Y. That is, if Y is equal to 2.5, └Y┘ is equal to 2. For example, └ν/n_(shift) ^(RA)┘ indicates rounded-down of ν/n_(shift) ^(RA).

It should be noted that, in the present application, mod indicates a modulo operation. For example, 4 mod 2=0, and 5 mod 2=1.

Optionally, in the case of ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1), the base station obtains the cyclic shift value C_(ν) by using formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1), the base station obtains the cyclic shift value C_(ν) by using formula (2); or

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the base station obtains the cyclic shift value C_(ν) by using formula (3).

Step 203: The base station generates a detection sequence according to the cyclic shift value, and detects, by using the detection sequence, the random access sequence sent by the UE, where the random access sequence is generated by the UE according to the indication information.

A ZC sequence x_(u)(n) whose root is u may be defined as:

${{x_{u}(n)} = e^{{- j}\frac{\pi\;{{un}{({n + 1})}}}{N_{ZC}}}},$

0≤n≤N_(ZC)−1, where N_(ZC) is a length of the ZC sequence, and u is the root of the ZC sequence.

Specifically, the base station performs cyclic shift on the ZC sequence x_(u)(n) whose root is u. If the cyclic shift value is K, a ZC sequence generated according to the cyclic shift value is x_(u)((n+K)mod N_(ZC)), where N_(ZC) is a length of the ZC sequence.

Optionally, the base station performs, by using the detection sequence generated according to the cyclic shift value, related detection on the random access sequence sent by the UE. The base station may perform related detection in a time domain, or may perform detection in a frequency domain according to a frequency domain detection manner corresponding to a time domain—related detection manner.

Optionally, in step 202, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (4) to (11):

$\begin{matrix} {\mspace{79mu}{{n_{shift}^{RA} = \left\lfloor \frac{{4\; d_{u}} - N_{ZC}}{N_{CS}} \right\rfloor};}} & (4) \\ {\mspace{79mu}{{d_{start} = {{4\; d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};}} & (5) \\ {\mspace{79mu}{{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor};}} & (6) \\ {\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{N_{ZC} - {3\; d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};}} & (7) \\ {\mspace{79mu}{{{\overset{==}{n}}_{shift}^{RA} = \left\lfloor {{\min\left( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{{4\; d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} \right)}/N_{CS}} \right\rfloor};}} & (8) \\ {\mspace{79mu}{{{\overset{==}{d}}_{start} = {N_{ZC} - {3\; d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}{\overset{\_}{N}}_{CS}}}};}} & (9) \\ {{{\overset{\equiv}{n}}_{shift}^{RA} = {\left\lfloor {\left( {{\left( {1 - {\min\left( {1,{\overset{\_}{n}}_{shift}^{RA}} \right)}} \right)\left( {d_{u} - {n_{group}^{RA} \cdot d_{start}}} \right)} + {{\min\left( {1,{\overset{\_}{n}}_{shift}^{RA}} \right)}\left( {{4\; d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}} \right)}} \right)/N_{CS}} \right\rfloor - {\overset{==}{n}}_{shift}^{RA}}};} & (10) \\ {\mspace{79mu}{{\overset{\equiv}{d}}_{start} = {N_{ZC} - {2\; d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{==}{n}}_{shift}^{RA}{N_{CS}.}}}}} & (11) \end{matrix}$

Alternatively, in step 202, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (12) to (19):

$\begin{matrix} {{n_{shift}^{RA} = \left\lfloor \frac{N_{ZC} - {3\; d_{u}}}{N_{CS}} \right\rfloor};} & (12) \\ {{d_{start} = {N_{ZC} - {3\; d_{u}} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (13) \\ {{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor};} & (14) \\ {{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{{4\; d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};} & (15) \\ {{{\overset{==}{n}}_{shift}^{RA} = \left\lfloor {{\min\left( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{N_{ZC} - {3\; d_{u}} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} \right)}/N_{CS}} \right\rfloor};} & (16) \\ {{{\overset{==}{d}}_{start} = {d_{u} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};} & (17) \\ {{{\overset{\equiv}{n}}_{shift}^{RA} = 0};} & (18) \\ {{\overset{\equiv}{d}}_{start} = 0.} & (19) \end{matrix}$

Alternatively, in step 202, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (20) to (27):

$\begin{matrix} {{n_{shift}^{RA} = \left\lfloor \frac{{3\; d_{u}} - N_{ZC}}{N_{CS}} \right\rfloor};} & (20) \\ {{d_{start} = {{3\; d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (21) \\ {{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor};} & (22) \\ {{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{N_{ZC} - {2\; d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};} & (23) \\ {{{\overset{==}{n}}_{shift}^{RA} = 0};} & (24) \\ {{{\overset{==}{d}}_{start} = 0};} & (25) \\ {{{\overset{\equiv}{n}}_{shift}^{RA} = 0};} & (26) \\ {{\overset{\equiv}{d}}_{start} = 0.} & (27) \end{matrix}$

Alternatively, in step 202, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (28) to (35):

$\begin{matrix} {{n_{shift}^{RA} = \left\lfloor \frac{{NC} - {2\; d_{u}}}{N_{CS}} \right\rfloor};} & (28) \\ {{d_{start} = {{2\left( {N_{ZC} - {2\; d_{u}}} \right)} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (29) \\ {{n_{group}^{RA} = \left\lfloor \frac{N_{ZC} - d_{u}}{d_{start}} \right\rfloor};} & (30) \\ {{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{{3\; d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}};} & (31) \\ {{{\overset{==}{n}}_{shift}^{RA} = 0};} & (32) \\ {{{\overset{==}{d}}_{start} = 0};} & (33) \\ {{{\overset{\equiv}{n}}_{shift}^{RA} = 0};} & (34) \\ {{{\overset{\equiv}{d}}_{start} = 0},} & (35) \end{matrix}$ where

d_(u) is a cyclic shift corresponding to the random access sequence when a Doppler frequency shift is one time a PRACH subcarrier spacing.

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2\; N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2\; N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2\; N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2\; N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

It should be noted that, in the present application, max indicates obtaining a maximum value. For example, max (0,1)=1, and max (4,5)=5. min indicates obtaining a minimum value. For example, min (0,1)=0, and min (4,5)=4.

It should be noted that, any n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

that satisfy formulas (4) to (11), formulas (12) to (19), formulas (20) to (27), or formulas (28) to (35) fall within the protection scope of the present application.

In this embodiment, the base station selects the shift sequence number from the range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1); the base station obtains the cyclic shift value according to the shift sequence number; and the base station generates the detection sequence according to the cyclic shift value, and detects, by using the detection sequence, the random access sequence sent by the UE, where the random access sequence is generated by the UE according to the indication information. This resolves a problem that random access sequences of multiple UEs interfere with each other when a Doppler frequency shift is greater than one time a PRACH subcarrier spacing and is less than two times the PRACH subcarrier spacing, avoids interference between random access sequences of multiple UEs, and enables the base station to decode the random access sequence more accurately.

The following describes a reason why the problem that random access sequences of multiple UEs interfere with each other when a Doppler frequency shift is greater than one time a PRACH subcarrier spacing and is less than two times the PRACH subcarrier spacing in this embodiment can be avoided in the case of n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (4) to (11), formulas (12) to (19), formulas (20) to (27), or formulas (28) to (35).

Assuming that a signal sent by the UE is r(t)e^(j2πft), r(t) is a baseband signal, and e^(j2πft) is a carrier, a signal obtained after a Doppler frequency shift mΔf is r(t)e^(j2π(f+mΔf)t), where m is a positive integer, and Δf is one time a PRACH subcarrier spacing.

According to a property of inverse fast Fourier transform (IFFT), a reciprocal of a frequency domain spacing is equal to a time domain period, and this is equivalent to

${{\Delta\; f} = \frac{1}{N\;\Delta\; t}},$ where Δf is a subcarrier spacing, Δt is a time domain sampling interval, and N is a value of discrete Fourier transform (DFT) or inverse discrete Fourier transform (IDFT).

t=nΔt is set, and in this case, r(t)e^(j2π(f+mΔf)t)=(r(t)e^(j2π(mn)/N))e^(j2πft). (r(t)e^(j2π(mn)/N)) is an equivalent baseband signal.

Property 1:

The UE sends the random access sequence to the base station. If there is a Doppler frequency shift ±mΔf between receive ends of the UE and the base station, a random access sequence received on the receive end of the base station is a shift sequence of the random access sequence sent by the UE, and there is a fixed phase shift between the two sequences.

Proof: For example, the Doppler frequency shift is −mΔf. A baseband sampling signal of a time domain t=nΔt is marked as r(n). For the equivalent baseband signal (r(t)e^(−j2π(mn)/N)), N=N_(ZC) is set. In this case, a baseband sampling signal of the equivalent baseband signal of a ZC sequence is

${{r(n)} = {W^{\frac{{un}{({n + 1})}}{2}}W^{mn}}},$ where

${{r(n)} = {W^{\frac{{un}{({n + 1})}}{2}}W^{mn}}};$ and

$\begin{matrix} \begin{matrix} {{r(n)} = {W^{\frac{{un}{({n + 1})}}{2}}W^{mn}}} \\ {= W^{\frac{u{\lbrack{{n{({n + 1})}} + {2\;{m{({1/u})}}n}}\rbrack}}{2}}} \\ {= W^{\frac{u{\lbrack{n^{2} + n + {2\;{m{({1/u})}}n}}\rbrack}}{2}}} \\ {= W^{\frac{u{\lbrack{{n{({n + {m{({1/u})}} + 1})}} + {{m{({1/u})}}{({n + {m{({1/u})}} + 1})}} - {{m{({1/u})}}{({{m{({1/u})}} + 1})}}}\rbrack}}{2}}} \\ {= W^{\frac{u{\lbrack{{{({n + {m{({1/u})}}})}{({n + {m{({1/u})}} + 1})}} - {{m{({1/u})}}{({{m{({1/u})}} + 1})}}}\rbrack}}{2}}} \\ {= {W^{\frac{{u{({n + {m{({1/u})}}})}}{({n + {m{({1/u})}} + 1})}}{2}}W^{\frac{{- {{um}{({1/u})}}}{({{m{({1/u})}} + 1}}}{2}}}} \\ {{= {{x_{u}\left( {n + {m\left( {1/u} \right)}} \right)}W^{\frac{{- {{um}{({1/u})}}}{({{m{({1/u})}} + 1})}}{2}}}},} \end{matrix} & (37) \end{matrix}$ where

x_(u)(n) indicates a ZC sequence whose root is u, that is,

${{x_{u}(n)} = e^{{- j}\frac{\pi\;{{un}{({n + 1})}}}{N_{ZC}}}};$ and x_(u)(n+m(1/u)) indicates a shift sequence of the ZC sequence whose root is u, that is, right cyclic shift is performed on the ZC sequence whose root is u by m(1/u) bits.

In formula (37),

$\frac{1}{u}$ is defined as a minimum non-negative integer that satisfies ((1/u)×u)mod N_(ZC)=1.

As can be learned from formula (37):

$\frac{1}{u}$ is a cyclic shift corresponding to the random access sequence when the Doppler frequency shift is one time a PRACH subcarrier spacing, that is, a length that is of a cyclic shift between the random access sequence received by the base station and the random access sequence sent by the UE and that exists when the Doppler frequency shift is one time a PRACH subcarrier spacing.

For example, if the random access sequence sent by the UE is x_(u)(n), when the Doppler frequency shift is one time a PRACH subcarrier spacing, the random access sequence received by the base station is

${x_{u}\left( {\left( {n + \frac{1}{u}} \right){mod}\; N_{ZC}} \right)}\mspace{14mu}{or}\mspace{14mu}{{x_{u}\left( {\left( {n - \frac{1}{u}} \right){mod}\; N_{ZC}} \right)}.}$

As can be learned from formula (15): if there is a Doppler frequency shift −mΔf between receive ends of the UE and the base station, in a time domain, the random access sequence received by the base station is a shift sequence of the random access sequence sent by the UE, and there is a fixed phase offset

$W^{\frac{{- {{um}{({1/u})}}}{({{m{({1/u})}} + 1})}}{2}}$ (unrelated to n) between the two sequences. Similarly, for a Doppler frequency shift +mΔf, the random access sequence received by the base station in a time domain is also a shift sequence of the random access sequence sent by the UE. Details are not described herein again.

Property 2: When the Doppler frequency shift is relatively large, and the Doppler frequency shift f_(off) is less than one time a PRACH subcarrier spacing Δf, related peak values may appear in three positions of sequence shifts

$\frac{1}{u},0,{{and}\mspace{14mu} - \frac{1}{u}}$ when sequences are correlated.

That is, for the ZC sequence x_(u)(n) whose root is u, when the Doppler frequency shift f_(off) is less than one time a PRACH subcarrier spacing Δf, and the random access sequence sent by the UE is x_(u)(n), there is a peak value when the receive end of the base station uses a sequence x_(u)(n),

${x_{u}\left( {\left( {n + \frac{1}{u}} \right){mod}\; N_{ZC}} \right)},{{or}\mspace{14mu}{x_{u}\left( {\left( {n - \frac{1}{u}} \right){mod}\; N_{ZC}} \right)}}$ to correlate with the random access sequence sent by the UE.

It should be noted that, property 2 is determined through an experiment.

As can be learned from property 1 and property 2:

1) When a Doppler frequency shift is f_(off)=Δf+x, and 0<x<Δf, during receiving by the base station, peak values are generated in three positions of shifts

${- \frac{1}{u}},{{- 2}\frac{1}{u}},$ and 0.

That is, for the ZC sequence x_(u)(n) whose root is u, when a Doppler frequency shift is f_(off)=Δf+x (0<x<Δf), and the random access sequence sent by the UE is x_(u)(n), there is a peak value when the receive end of the base station uses a sequence x_(u)(n),

${x_{u}\left( {\left( {n + \frac{1}{u}} \right){mod}\; N_{ZC}} \right)},{{or}\mspace{14mu}{x_{u}\left( {\left( {n - \frac{1}{u}} \right){mod}\; N_{ZC}} \right)}}$ to correlate with the random access sequence sent by the UE.

2) When the Doppler frequency shift is f_(off)=Δf+x, and 0<x<Δf, during receiving by the base station, peak values are generated in three positions of shifts

${- \frac{1}{u}},{{- 2}\frac{1}{u}},$ and 0.

That is, for the ZC sequence x_(u)(n) whose root is u, when the Doppler frequency shift is f_(off)=Δf+x (0<x<Δf), and the random access sequence sent by the UE is x_(u)(n), there is a peak value when the receive end of the base station uses a sequence x_(u)(n),

${x_{u}\left( {\left( {n - \frac{1}{u}} \right){mod}\; N_{ZC}} \right)},{{or}\mspace{14mu}{x_{u}\left( {\left( {n - {2\frac{1}{u}}} \right){mod}\; N_{ZC}} \right)}}$ to correlate with the random access sequence sent by the UE.

Therefore, when the Doppler frequency shift is greater than one time a PRACH subcarrier spacing Δf and is less than two times the PRACH subcarrier spacing, during receiving by the base station, peak values may be generated in five positions of shifts

${- \frac{1}{u}},{{- 2}\frac{1}{u}},0,\frac{1}{u},{{and}\mspace{14mu} 2{\frac{1}{u}.}}$

That is, for the ZC sequence x_(u)(n) whose root is u, when the Doppler frequency shift is greater than one time a PRACH subcarrier spacing Δf and is less than two times the PRACH subcarrier spacing, and the random access sequence sent by the UE is x_(u)(n), there may be a peak value when the receive end of the base station uses a sequence

${x_{u}\left( {\left( {n - {2\;\frac{1}{u}}} \right){mod}\; N_{ZC}} \right)},{x_{u}\left( {\left( {n - \frac{1}{u}} \right){mod}\; N_{ZC}} \right)},{x_{u}(n)},{x_{u}\left( {\left( {n + \frac{1}{u}} \right){mod}\; N_{ZC}} \right)},{{or}\mspace{14mu}{x_{u}\left( {\left( {n + {2\;\frac{1}{u}}} \right){mod}\; N_{ZC}} \right)}}$ to correlate with the random access sequence sent by the UE.

In this embodiment, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (4) to (11), formulas (12) to (19), formulas (20) to (27), or formulas (28) to (35), to prevent the receive end of the base station from allocating, to another user, a sequence corresponding to five peak value points generated when the Doppler frequency shift is greater than one time a PRACH subcarrier spacing and is less than two times the PRACH subcarrier spacing, and thereby avoid interference between users that is caused by the Doppler frequency shift.

When

${\frac{1}{u} \geq \frac{N_{ZC}}{2}},$ a sequence obtained when left cyclic shift is performed on the ZC sequence by

$\frac{1}{u}$ is the same as a sequence obtained when right cyclic shift is performed on the ZC sequence by

$N_{ZC} - {\frac{1}{u}.}$ Therefore, in the present application,

$d_{u} = \left\{ {\begin{matrix} p & {0 \leq p < {N_{ZC}/2}} \\ {N_{ZC} - p} & {{another}\mspace{14mu}{value}} \end{matrix},} \right.$ where

$p = {\frac{1}{u}.}$ As can be learned, d_(u) is a cyclic shift corresponding to the random access sequence when the Doppler frequency shift is one time a PRACH subcarrier spacing.

FIG. 3 is a schematic diagram of scenario 1 according to an embodiment of the present application. In the figure, N=N_(ZC), and satisfies

$\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}{{N_{ZC}\left( {{{or}\mspace{14mu}\frac{N_{ZC} + N_{CS}}{4}} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}} \right)}.}}$ As shown in FIG. 3, sequence shifts that are occupied by 1₀, 1₊₁, 1₊₂, 1⁻¹, and 1₊₂ are used as a first group, and sequence shifts that are occupied by 2₀, 2₊₁, 2₊₂, 2⁻¹, and 2₊₂ are used as a second group. A quantity of UE candidate sequence shifts in a group is

${n_{shift}^{RA} = \left\lfloor \frac{{4d_{u}} - N_{ZC}}{N_{CS}} \right\rfloor},$ where N_(CS) indicates a quantity of cyclic shifts that are occupied by a user. For example, a sequence length is N_(ZC), and a user occupies N_(CS) shifts. When the Doppler frequency shift is not considered, a maximum of └N_(ZC)/N_(CS)┘ users are simultaneously supported to simultaneously send the random access sequence.

n_(shift) ^(RA) also indicates a quantity of users that can be distinguished in a group. From a perspective of a system, n_(shift) ^(RA) users can be distinguished in a group. From a perspective of a UE side, one UE may select a maximum of n_(shift) ^(RA) sequence shifts in a group.

It should be noted that, for the ZC sequence whose sequence length is N_(ZC) when the Doppler frequency shift is not considered and N_(CS)=0, the ZC sequence may have N_(ZC) candidate sequence shifts, which respectively correspond to cyclic shift values 0 to N_(ZC)−1. For example, if the ZC sequence whose root is u is marked as x_(u)(n), when the cyclic shift value is 0, a generated sequence thereof is x_(u)(n). When the cyclic shift value is 1, a generated sequence thereof is x_(u)(n+1). When the Doppler frequency shift is not considered and N_(CS) is greater than 0, there may be └N_(ZC)/N_(CS)┘ candidate sequence shifts, which respectively correspond to cyclic shift values Y*N_(CS), where Y is an integer greater than or equal to 0 and less than └N_(ZC)/N_(CS)┘−1.

When the Doppler frequency shift is greater than one time a PRACH subcarrier spacing and is less than two times the PRACH subcarrier spacing, first user equipment generates a random access sequence according to a first cyclic shift value and sends the random access sequence to the base station. When the base station detects, by using a sequence corresponding to five cyclic shift values, the random access sequence sent by the first user equipment, there may be a peak value, and differences between the cyclic shift values and the first cyclic shift value are respectively 0, d_(u), −d_(u), 2d_(u), and −2d_(u). Therefore, to avoid interference between the first user equipment and another user equipment, none of candidate sequence shifts corresponding to the five cyclic shift values can be allocated to the another user equipment. In addition, for the base station side, this is equivalent to that the candidate sequence shifts corresponding to the five cyclic shift values are all allocated to the first user equipment. That is, as shown in FIG. 3, sequence shifts (that is, sequence shifts that are occupied by 1₀, 1₊₁, 1₊₂, 1⁻¹, and 1₊₂) related to “1” are used as candidate sequence shifts of a same group of UEs, and sequence shifts (that is, sequence shifts that are occupied by 2₀, 2₊₁, 2₊₂, 2⁻¹, and 2₊₂) related to “2” are used as candidate sequence shifts of a same group of UEs.

In addition, because the differences between the five cyclic shift values and the first cyclic shift value are respectively 0, d_(u), −d_(u), 2d_(u), and −2d_(u), it can also be learned that, for first UE in a first group of UEs, an initial sequence shift of sequence shifts that are occupied by 1₀ is a cyclic shift value of the first UE in the first group of UEs. For first UE in a second group of UEs, an initial sequence shift of sequence shifts that are occupied by 2₀ is a cyclic shift value of the first UE in the second group of UEs.

d_(start)=4d_(u)−N_(ZC)+n_(shift) ^(RA)·N_(CS) indicates a cyclic shift distance between neighboring groups, as shown by filling patterns of lattice patterns in FIG. 3.

$n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor$ indicates a quantity of groups in a sequence whose sequence length is N_(ZC). As shown in FIG. 3, a quantity of groups is 2 (that is, the first group and the second group).

${\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{N_{ZC} - {3d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}$ indicates a quantity of UE candidate sequence shifts in the last length that is insufficient for a group. The quantity of UE candidate sequence shifts in the last length that is insufficient for a group is 0 in FIG. 3.

n _(shift) ^(RA)=└min(d_(u)−n_(group) ^(RA)·d_(start), 4d_(u)−N_(ZC)−n _(shift) ^(RA)N_(CS))/N_(CS)┘ indicates a quantity of UE candidate sequence shifts in first remaining sequence shifts, where the first remaining sequence shift is shown by filling patterns of stripes slanting towards left in FIG. 3.

=└((1−min(1,n _(shift) ^(RA)))(d_(u)−n_(group) ^(RA)·d_(start))+min(1,n _(shift) ^(RA))(4d_(u)−N_(ZC)+n_(shift) ^(RA)·N_(CS)))/N_(CS)┘−n _(shift) ^(RA) indicates a quantity of UE candidate sequence shifts in second remaining sequence shifts, where the second remaining sequence shift is shown by filling patterns of stripes slanting towards right in FIG. 3.

d _(start)=N_(ZC)−3d_(u)+n_(group) ^(RA)·d_(start)+n _(shift) ^(RA)N_(CS) indicates a cyclic shift value of a first UE candidate sequence shift in the first remaining sequence shifts, and is identified by an arrow X in FIG. 3.

_(start)=N_(ZC)−2d_(u)+n_(group) ^(RA)·d_(start)+n _(shift) ^(RA)N_(CS) indicates a cyclic shift value of a first UE candidate sequence shift in the second remaining sequence shifts, and is identified by an arrow Y in FIG. 3.

For example, when N_(ZC)=839, N_(CS)=18, and d_(u)=222, a corresponding scenario may be shown in FIG. 3.

It should be noted that, filling patterns of round point patterns in FIG. 3 are used to synchronously indicate one of five shift sequences occupied by a group, to more easily describe how to allocate each group.

FIG. 4 is a schematic diagram of scenario 2 according to an embodiment of the present application. In the figure, N=N_(ZC), and satisfies

$\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}{{N_{ZC}\left( {{{or}\mspace{14mu}\frac{N_{ZC} + N_{CS}}{4}} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}} \right)}.}}$ As shown in FIG. 4, sequence shifts that are occupied by 1₀, 1₊₁, 1₊₂, 1⁻¹, and 1₊₂ are used as a first group, and sequence shifts that are occupied by 2₀, 2₊₁, 2₊₂, 2⁻¹, and 2₊₂ are used as a second group. A quantity of UE candidate sequence shifts in a group is

${n_{shift}^{RA} = \left\lfloor \frac{N_{ZC} - {3d_{u}}}{N_{CS}} \right\rfloor},$ where N_(CS) indicates a quantity of cyclic shifts that are occupied by a user.

It should be noted that, in FIG. 4 and FIG. 3, physical meanings of n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

and formulas that need to be satisfied are all the same. Details are not described herein again.

d_(start) is shown by filling patterns of lattice patterns in FIG. 4, n _(shift) ^(RA) is shown by filling patterns of stripes slanting towards left in FIG. 4, and d _(start) is identified by an arrow X in FIG. 4.

In FIG. 4, n_(group) ^(RA) is 2, n _(shift) ^(RA) is 0,

_(shift) ^(RA) is 0, and

is 0 (corresponding to that

_(shift) ^(RA) is 0).

For example, when N_(ZC)=839, N_(CS)=22, and d_(u)=221, this may correspond to the scenario shown in FIG. 4.

It should be noted that, filling patterns of round point patterns in FIG. 4 are used to synchronously indicate one of five shift sequences occupied by one group, to more easily describe how to allocate each group.

FIG. 5 is a schematic diagram of scenario 3 according to an embodiment of the present application. In the figure, N=N_(ZC), and satisfies

$\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}{{N_{ZC}\left( {{{or}\mspace{14mu}\frac{N_{ZC} + N_{CS}}{4}} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}} \right)}.}}$ As shown in FIG. 5, sequence shifts that are occupied by 1₀, 1₊₁, 1₊₂, 1⁻¹, and 1₊₂ are used as a first group, and sequence shifts that are occupied by 2₀, 2₊₁, 2₊₂, 2⁻¹, and 2₊₂ are used as a second group. A quantity of UE candidate sequence shifts in a group is

${n_{shift}^{RA} = \left\lfloor \frac{{3d_{u}} - N_{ZC}}{N_{CS}} \right\rfloor},$ where N_(CS) indicates a quantity of cyclic shifts that are occupied by a user.

It should be noted that, in FIG. 5 and FIG. 3, physical meanings of n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

and formulas that need to be satisfied are all the same. Details are not described herein again.

d_(start) is shown by filling patterns of lattice patterns in FIG. 5, n _(shift) ^(RA) is shown by filling patterns of stripes slanting towards left in FIG. 5, and d _(start) is identified by an arrow X in FIG. 5.

In FIG. 5, n_(group) ^(RA) is 2,

_(shift) ^(RA) is 0, and

is 0 (corresponding to that

_(shift) ^(RA) is 0).

In FIG. 5, n _(shift) ^(RA) may be 1. That is, five candidate sequence shifts corresponding to filling patterns of characters A (which may correspond to 0), B (which may correspond to +d_(u)), C (which may correspond to +2d_(u)), D (which may correspond to −d_(u)), and E (which may correspond to −2d_(u)) are used as a new candidate sequence shift and are allocated to UE.

For example, when N_(ZC)=839, N_(CS)=18, and d_(u)=220, this may correspond to the scenario shown in FIG. 5.

It should be noted that, filling patterns of round point patterns in FIG. 5 are used to synchronously indicate one of five shift sequences occupied by one group, to more easily describe how to allocate each group.

FIG. 6 is a schematic diagram of scenario 4 according to an embodiment of the present application. In the figure, N=N_(ZC), and satisfies

${\frac{2}{7}N_{ZC}} \leq d_{u} \leq {\frac{N_{ZC} - N_{CS}}{3}{\left( {{{or}\mspace{14mu}\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}} \right).}}$ As shown in FIG. 6, sequence shifts that are occupied by 1₀, 1₊₁, 1₊₂, 1⁻¹, and 1₊₂ are used as a first group, and sequence shifts that are occupied by 2₀, 2₊₁, 2₊₂, 2⁻¹, and 2₊₂ are used as a second group. A quantity of UE candidate sequence shifts in a group is

$n_{shift}^{RA} = {\left\lfloor \frac{N_{ZC} - {3d_{u}}}{N_{CS}} \right\rfloor.}$

It should be noted that, in FIG. 6 and FIG. 3, n_(shift) ^(RA), d_(start), n_(group) ^(RA), and n _(shift) ^(RA) have save physical meanings, and only formulas that need to be satisfied are different. An analysis process is similar to that of FIG. 3. Details are not described herein again.

d_(start)=N_(ZC)−3d_(u)+n_(shift) ^(RA)·N_(CS) indicates a cyclic shift distance between neighboring groups, and is shown by filling patterns of lattice patterns in FIG. 6.

$n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor$ indicates a quantity of groups in a sequence whose sequence length is N_(ZC). As shown in FIG. 6, a quantity of groups is 2.

${\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{{4d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}$ indicates a quantity of UE candidate sequence shifts in the last length that is insufficient for a group. As shown in FIG. 6, the quantity of UE candidate sequence shifts in the last length that is insufficient for a group may be 1. That is, five candidate sequence shifts corresponding to filling patterns of characters A, B, C, D, and E are used as a new candidate sequence shift and are allocated to UE.

n _(shift) ^(RA)=└min(d_(u)−n_(group) ^(RA)·d_(start), N_(ZC)−3d_(u)−n _(shift) ^(RA)N_(CS))/N_(CS)┘ indicates a quantity of UE candidate sequence shifts in first remaining sequence shifts. The first remaining sequence shift is shown by filling patterns of stripes slanting towards left in FIG. 6.

_(shift) ^(RA)=0 indicates that a quantity of UE candidate sequence shifts in second remaining sequence shifts is 0.

d _(start)=d_(u)+n_(group) ^(RA)·d_(start)+n _(shift) ^(RA)N_(CS) indicates a cyclic shift value of a first UE candidate sequence shift in the first remaining sequence shifts, and is identified by an arrow X in FIG. 6.

_(start)=0 (corresponding to

_(shift) ^(RA)=0).

For example, when N_(ZC)=839, N_(CS)=22, and d_(u)=264, this may correspond to the scenario shown in FIG. 6.

It should be noted that, filling patterns of round point patterns in FIG. 6 are used to synchronously indicate one of five shift sequences occupied by one group, and filling patterns of vertical line patterns are used to synchronously indicate sequence shifts that are occupied by filling patterns of characters, to more easily describe how to allocate each group.

FIG. 7 is a schematic diagram of scenario 5 according to an embodiment of the present application. In the figure, N=N_(ZC), and satisfies and satisfies

${\frac{2}{7}N_{ZC}} \leq d_{u} \leq {\frac{N_{ZC} - N_{CS}}{3}{\left( {{{or}\mspace{14mu}\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}} \right).}}$ As shown in FIG. 7, sequence shifts that are occupied by 1₀, 1₊₁, 1₊₂, 1⁻¹, and 1₊₂ are used as a first group, and sequence shifts that are occupied by 2₀, 2₊₁, 2₊₂, 2⁻¹, and 2₊₂ are used as a second group. A quantity of UE candidate sequence shifts in a group is

${n_{shift}^{RA} = \left\lfloor \frac{N_{ZC} - {3d_{u}}}{N_{CS}} \right\rfloor},$ where N_(CS) indicates a quantity of cyclic shifts that are occupied by a user.

It should be noted that, in FIG. 7 and FIG. 6, physical meanings of n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

and formulas that need to be satisfied are all the same. Details are not described herein again.

d_(start) is shown by filling patterns of lattice patterns in FIG. 7, n _(shift) ^(RA) is shown by filling patterns of stripes slanting towards left in FIG. 7, and d _(start) is identified by an arrow X in FIG. 7.

In FIG. 7, n_(group) ^(RA) is 2, n _(shift) ^(RA) is 0,

_(shift) ^(RA) is 0, and

is 0 (corresponding to that

_(shift) ^(RA) is 0).

For example, when N_(ZC)=839, N_(CS)=22, and d_(u)=261, this may correspond to the scenario shown in FIG. 7.

It should be noted that, filling patterns of round point patterns in FIG. 7 are used to synchronously indicate one of five shift sequences occupied by one group, to more easily describe how to allocate each group.

FIG. 8 is a schematic diagram of scenario 6 according to an embodiment of the present application. In the figure, N=N_(ZC), and satisfies

$\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < {\frac{2N_{ZC}}{5}{\left( {{{or}\mspace{14mu}\frac{N_{ZC} + N_{CS}}{3}} \leq d_{u} \leq \frac{2N_{ZC}}{5}} \right).}}$ As shown in FIG. 7, sequence shifts that are occupied by 1₀, 1₊₁, 1₊₂, 1⁻¹, and 1₊₂ are used as a first group, and sequence shifts that are occupied by 2₀, 2₊₁, 2₊₂, 2⁻¹, and 2₊₂ are used as a second group. A quantity of UE candidate sequence shifts in a group is

$n_{shift}^{RA} = {\left\lfloor \frac{{3d_{u}} - N_{ZC}}{N_{CS}} \right\rfloor.}$

It should be noted that, in FIG. 8 and FIG. 3, n_(shift) ^(RA), d_(start), n_(group) ^(RA), and n _(shift) ^(RA) have save physical meanings, and only formulas that need to be satisfied are different. An analysis process is similar to that of FIG. 3. Details are not described herein again.

d_(start)=N_(ZC)−3d_(u)+n_(shift) ^(RA)·N_(CS) indicates a cyclic shift distance between neighboring groups, and is shown by filling patterns of lattice patterns in FIG. 8.

$n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor$ indicates a quantity of groups in a sequence whose sequence length is N_(ZC). As shown in FIG. 8, a quantity of groups is 2.

${\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{N_{ZC} - {2d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}$ indicates a quantity of UE candidate sequence shifts in the last length that is insufficient for a group. As shown in FIG. 8, the quantity of UE candidate sequence shifts in the last length that is insufficient for a group may be 1. That is, five candidate sequence shifts corresponding to filling patterns of characters A, B, C, D, and E are used as a new candidate sequence shift and are allocated to UE.

n _(shift) ^(RA)=0 indicates that a quantity of UE candidate sequence shifts in first remaining sequence shifts is 0.

_(shift) ^(RA)=0 indicates that a quantity of UE candidate sequence shifts in second remaining sequence shifts is 0.

d _(start)=0 (corresponding to n _(shift) ^(RA)=0).

_(start)=0 (corresponding to

_(shift) ^(RA)=0).

For example, when N_(ZC)=839, N_(CS)=22, and d_(u)=300, this may correspond to the scenario shown in FIG. 8.

FIG. 9 is a schematic diagram of scenario 7 according to an embodiment of the present application. In the figure, N=N_(ZC), and satisfies

$\frac{2N_{ZC}}{5} \leq d_{u} < {\frac{N_{ZC} - N_{CS}}{2}{\left( {{{or}\mspace{14mu}\frac{2N_{ZC}}{5}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}} \right).}}$ As shown in FIG. 9, sequence shifts that are occupied by 1₀, 1₊₁, 1₊₂, 1⁻¹, and 1₊₂ are used as a first group, and sequence shifts that are occupied by 2₀, 2₊₁, 2₊₂, 2⁻¹, and 2₊₂ are used as a second group. A quantity of UE candidate sequence shifts in a group is

$n_{shift}^{RA} = {\left\lfloor \frac{N_{ZC} - {2d_{u}}}{N_{CS}} \right\rfloor.}$

It should be noted that, in FIG. 9 and FIG. 3, n_(shift) ^(RA), d_(start), n_(group) ^(RA), and n _(shift) ^(RA) have save physical meanings, and only formulas that need to be satisfied are different. An analysis process is similar to that of FIG. 3. Details are not described herein again.

d_(start)=2(N_(ZC)−2d_(u))+n_(shift) ^(RA)·N_(CS) indicates a cyclic shift distance between neighboring groups, and is shown by filling patterns of lattice patterns in FIG. 9.

$n_{group}^{RA} = \left\lfloor \frac{N_{ZC} - d_{u}}{d_{start}} \right\rfloor$ indicates a quantity of groups in a sequence whose sequence length is N_(ZC). As shown in FIG. 9, a quantity of groups is 2.

${\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{{3d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}$ indicates a quantity of UE candidate sequence shifts in the last length that is insufficient for a group. As shown in FIG. 9, the quantity of UE candidate sequence shifts in the last length that is insufficient for a group may be 1. That is, five candidate sequence shifts corresponding to filling patterns of characters A, B, C, D, and E are used as a new candidate sequence shift and are allocated to UE.

n _(shift) ^(RA)=0 indicates that a quantity of UE candidate sequence shifts in first remaining sequence shifts is 0.

_(shift) ^(RA)=0 indicates that a quantity of UE candidate sequence shifts in second remaining sequence shifts is 0.

d _(start)=0 (corresponding to n _(shift) ^(RA)=0).

_(start)=0 (corresponding to

_(shift) ^(RA)=0).

For example, when N_(ZC)=839, N_(CS)=22, and d_(u)=393, this may correspond to the scenario shown in FIG. 9.

FIG. 10 is a flowchart of Embodiment 3 of a random access sequence generation method according to the present application. As shown in FIG. 10, the method in this embodiment may include:

Step 1001: UE receives notification signaling from a base station, where the notification signaling includes indication information, the indication information is used to instruct the UE to select a shift sequence number from a range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the shift sequence number is an integer, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in a group, n_(group) ^(RA) is a quantity of groups, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in the last length that is insufficient for a group, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in first remaining sequence shifts, and

_(shift) ^(RA) is a quantity of UE candidate sequence shifts in second remaining sequence shifts.

Step 1002: The UE selects a shift sequence number according to the notification signaling.

Specifically, the UE selects the shift sequence number from the range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1) according to the notification signaling.

Step 1003: The UE obtains a cyclic shift value according to the shift sequence number.

Step 1004: The UE generates a random access sequence according to the cyclic shift value.

In this embodiment, the UE selects the shift sequence number from the range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1) according to the notification signaling, so that after a quantity of UEs that can be distinguished is considered from a perspective of a group, quantities of UEs that can be further distinguished in other remaining discrete shift sequences obtained after grouping are further considered, thereby expanding a range from which a shift sequence number is selected.

Embodiment 4 of the random access sequence generation method is as follows:

Optionally, based on Embodiment 3 of the random access sequence generation method in the present application, step 1003 may specifically include:

obtaining, by the UE, the cyclic shift value C_(ν) according to the shift sequence number ν by using formula (1), formula (2), or formula (3).

Optionally, in the case of ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1), the UE obtains the cyclic shift value C_(ν) by using formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1), the UE obtains the cyclic shift value C_(ν) by using formula (2);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the UE obtains the cyclic shift value C_(ν) by using formula (3).

Optionally, step 1004 may specifically include:

generating, by the UE, the random access sequence x_(u,C) _(ν) (n) according to the cyclic shift value C_(ν) by using the following formula (36): x _(u,C) _(ν) (n)=x _(u)((n+C _(ν))mod N _(ZC))  (36), where

N_(ZC) is a sequence length, and a ZC sequence whose root is u is defined as:

${{x_{u}(n)} = e^{{- j}\;\frac{\pi\;{{un}{({n + 1})}}}{N_{ZC}}}},$ 0≤n≤N_(ZC)−1.

In this embodiment, detailed descriptions of n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

are the same as those in Embodiment 2 of the random access sequence generation method. Details are not described herein again.

FIG. 11 is a flowchart of Embodiment 5 of a random access sequence generation method according to the present application. As shown in FIG. 11, the method in this embodiment may include:

Step 1101: A base station selects a shift sequence number.

Specifically, the base station selects the shift sequence number ν from a range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), where ν is an integer, n_(shift) ^(RA) is a quantity of user equipment UE candidate sequence shifts in a group, n_(group) ^(RA) is a quantity of groups, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in the last length that is insufficient for a group, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in first remaining sequence shifts, and

_(shift) ^(RA) is a quantity of UE candidate sequence shifts in second remaining sequence shifts.

Step 1102: The base station obtains a cyclic shift value according to the shift sequence number.

Specifically, the base station obtains the cyclic shift value C_(ν) according to the shift sequence number ν by using the following formula (1), formula (2), or formula (3): C _(ν) =d _(offset) +d _(start) └ν/n _(shift) ^(RA)┘+(ν mod n _(shift) ^(RA))N _(CS)  (1); C _(ν) =d _(offset) +d _(start)+(ν−n _(shift) ^(RA) n _(group) ^(RA) +n _(shift) ^(RA))N _(CS)  (2); C _(ν) =d _(offset) +

_(start)+(ν−n _(shift) ^(RA) n _(group) ^(RA) +n _(shift) ^(RA) +n _(shift) ^(RA))N _(CS)  (3), where

d_(offset) is a shift offset, d_(start) is a cyclic shift distance between neighboring groups, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in a group, N_(CS) is a quantity of cyclic shifts that are occupied by a user, d _(start) is a cyclic shift value of a first UE candidate sequence shift in the first remaining sequence shifts, and

is a cyclic shift value of a first UE candidate sequence shift in the second remaining sequence shifts.

In this embodiment, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (4) to (11); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (20) to (27); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (28) to (35).

It should be noted that, in this embodiment, detailed descriptions of n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

are the same as those in Embodiment 2 of the random access sequence generation method. Details are not described herein again.

Optionally, in the case of ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1), the base station obtains the cyclic shift value C_(ν) by using formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1), the base station obtains the cyclic shift value C_(ν) by using formula (2);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the base station obtains the cyclic shift value C_(ν) by using formula (3).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

In this embodiment, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) that satisfy formulas (4) to (11), formulas (12) to (19), formulas (20) to (27), or formulas (28) to (35) are used, and the shift sequence number is selected from the range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), thereby expanding a range from which a shift sequence number is selected.

FIG. 12 is a flowchart of Embodiment 6 of a random access sequence generation method according to the present application. As shown in FIG. 12, the method in this embodiment may include:

Step 1201: UE selects a shift sequence number.

Specifically, the UE selects the shift sequence number ν from a range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1).

ν is an integer, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in a group, n_(group) ^(RA) is a quantity of groups, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in the last length that is insufficient for a group, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in first remaining sequence shifts, and

_(shift) ^(RA) is a quantity of UE candidate sequence shifts in second remaining sequence shifts.

Step 1202: The UE obtains a cyclic shift value according to the shift sequence number.

Specifically, the UE obtains the cyclic shift value C_(ν) according to the shift sequence number ν by using the following formula (1), formula (2), or formula (3): C _(ν) =d _(offset) +d _(start) └ν/n _(shift) ^(RA)┘+(ν mod n _(shift) ^(RA))N _(CS)  (1); C _(ν) =d _(offset) +d _(start)+(ν−n _(shift) ^(RA) n _(group) ^(RA) +n _(shift) ^(RA))N _(CS)  (2); C _(ν) =d _(offset) +

_(start)+(ν−n _(shift) ^(RA) n _(group) ^(RA) +n _(shift) ^(RA) +n _(shift) ^(RA))N _(CS)  (3), where

d_(offset) is a shift offset, d_(start) is a cyclic shift distance between neighboring groups, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in a group, N_(CS) is a quantity of cyclic shifts that are occupied by a user, d _(start) is a cyclic shift value of a first UE candidate sequence shift in the first remaining sequence shifts, and

is a cyclic shift value of a first UE candidate sequence shift in the second remaining sequence shifts.

Step 1203: The UE generates a random access sequence according to the cyclic shift value.

Specifically, the UE generates the random access sequence x_(u,C) _(ν) (n) according to the cyclic shift value C_(ν) by using the following formula (36): x _(u,C) _(ν) (n)=x _(u)((n+C _(ν))mod N _(ZC))  (36), where

N_(ZC) is a sequence length, and a ZC sequence whose root is u is defined as:

${{x_{u}(n)} = e^{{- j}\;\frac{\pi\;{{un}{({n + 1})}}}{N_{ZC}}}},$ 0≤n≤N_(ZC)−1.

In this embodiment, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (4) to (11); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (20) to (27); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (28) to (35).

It should be noted that, in this embodiment, detailed descriptions of n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

are the same as those in Embodiment 2 of the random access sequence generation method. Details are not described herein again.

Optionally, in the case of ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1), the base station obtains the cyclic shift value C_(ν) by using formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1), the base station obtains the cyclic shift value C_(ν) by using formula (2);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the base station obtains the cyclic shift value C_(ν) by using formula (3).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

In this embodiment, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) that satisfy formulas (4) to (11), formulas (12) to (19), formulas (20) to (27), or formulas (28) to (35) are used, and the shift sequence number is selected from the range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), thereby expanding a range from which a shift sequence number is selected.

FIG. 13 is a schematic structural diagram of Embodiment 1 of a base station according to the present application. As shown in FIG. 13, the base station in this embodiment may include: a generation module 1301 and a sending module 1302. The generation module 1301 is configured to generate notification signaling, where the notification signaling includes indication information, the indication information is configured to instruct user equipment UE to select a shift sequence number from a range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the shift sequence number is an integer, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in a group, n_(group) ^(RA) is a quantity of groups, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in the last length that is insufficient for a group, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in first remaining sequence shifts, and

_(shift) ^(RA) is a quantity of UE candidate sequence shifts in second remaining sequence shifts. The sending module 1302 is configured to send the notification signaling to the UE, so that the UE generates a random access sequence according to the indication information.

The base station in this embodiment may be configured to execute the technical solution in the method embodiment shown in FIG. 1. An implementation principle and a technical effect thereof are similar, and details are not described herein again.

FIG. 14 is a schematic structural diagram of Embodiment 2 of a base station according to the present application. As shown in FIG. 14, based on the structure of the base station shown in FIG. 13, the base station in this embodiment may further include: a shift sequence number determining module 1303, a cyclic shift value determining module 1304, and a random access sequence detection module 1305. The shift sequence number determining module 1303 is configured to select a shift sequence number from the range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1). The cyclic shift value determining module 1304 is configured to obtain a cyclic shift value according to the shift sequence number. The random access sequence detection module 1305 is configured to: generate a detection sequence according to the cyclic shift value, and detect, by using the detection sequence, a random access sequence sent by the UE, where the random access sequence is generated by the UE according to the indication information.

Optionally, the cyclic shift value determining module 1304 is specifically configured to:

obtain the cyclic shift value C_(ν) according to the shift sequence number ν by using formula (1), formula (2), or formula (3).

Optionally, in the case of ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1), the cyclic shift value determining module 1304 obtains the cyclic shift value C_(ν) by using formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1), the cyclic shift value determining module 1304 obtains the cyclic shift value C_(ν) by using formula (2);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the cyclic shift value determining module 1304 obtains the cyclic shift value C_(ν) by using formula (3).

Optionally, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (4) to (11); or

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (12) to (19); or

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (20) to (27); or

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (28) to (35).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

The base station in this embodiment may be configured to execute the technical solution in the method embodiment shown in FIG. 2. An implementation principle and a technical effect thereof are similar, and details are not described herein again.

FIG. 15 is a schematic structural diagram of Embodiment 1 of user equipment according to the present application. As shown in FIG. 15, the user equipment in this embodiment may include:

a receiving module 1501, a shift sequence number determining module 1502, a cyclic shift value determining module 1503, and a random access sequence generation module 1504. The receiving module 1501 is configured to receive notification signaling from a base station, where the notification signaling includes indication information, the indication information is used to instruct the UE to select a shift sequence number from a range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the shift sequence number is an integer, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in a group, n_(group) ^(RA) is a quantity of groups, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in the last length that is insufficient for a group, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in first remaining sequence shifts, and

_(shift) ^(RA) is a quantity of UE candidate sequence shifts in second remaining sequence shifts. The shift sequence number determining module 1502 is configured to select a shift sequence number from the range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1) according to the notification signaling.

The cyclic shift value determining module 1503 is configured to obtain a cyclic shift value according to the shift sequence number. The random access sequence generation module 1504 is configured to generate a random access sequence according to the cyclic shift value.

The UE in this embodiment may be configured to execute the technical solution in the method embodiment shown in FIG. 10. An implementation principle and a technical effect thereof are similar, and details are not described herein again.

Embodiment 2 of the user equipment is as follows:

Optionally, based on Embodiment 1 of the user equipment of the present application, the cyclic shift value determining module 1503 is specifically configured to:

obtain the cyclic shift value C_(ν) according to the shift sequence number ν by using formula (1), formula (2), or formula (3).

Optionally, in the case of ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1), the cyclic shift value determining module 1503 obtains the cyclic shift value C_(ν) by using formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1), the cyclic shift value determining module 1503 obtains the cyclic shift value C_(ν) by using formula (2);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the cyclic shift value determining module 1503 obtains the cyclic shift value C_(ν) by using formula (3).

Optionally, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (4) to (11); or

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (12) to (19); or

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (20) to (27); or

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (28) to (35).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Optionally, the random access sequence generation module 1504 is specifically configured to:

generate the random access sequence x_(u,C) _(ν) (n) according to the cyclic shift value C_(ν) by using the following formula (36): x _(u,C) _(ν) (n)=x _(u)((n+C _(ν))mod N _(ZC))  (36), where

N_(ZC) is a sequence length, and a ZC sequence whose root is u is defined as:

${{x_{u}(n)} = e^{{- j}\;\frac{\pi\;{{un}{({n + 1})}}}{N_{ZC}}}},$ 0≤n≤N_(ZC)−1.

The UE in this embodiment may be configured to execute the technical solution in Embodiment 4 of the random access sequence generation method. An implementation principle and a technical effect thereof are similar, and details are not described herein again.

The present application further provides a random access sequence generation system, including the base station in Embodiment 1 or Embodiment 2 of the base station, and the user equipment in Embodiment 1 or Embodiment 2 of the user equipment.

FIG. 16 is a schematic structural diagram of Embodiment 3 of a base station according to the present application. As shown in FIG. 16, the base station in this embodiment may include a shift sequence number determining module 1601 and a cyclic shift value determining module 1602. The shift sequence number determining module 1601 is configured to select a shift sequence number ν from a range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), where ν is an integer, n_(shift) ^(RA) is a quantity of user equipment UE candidate sequence shifts in a group, n_(group) ^(RA) is a quantity of groups, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in the last length that is insufficient for a group, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in first remaining sequence shifts, and

_(shift) ^(RA) is a quantity of UE candidate sequence shifts in second remaining sequence shifts.

The cyclic shift value determining module 1602 is configured to obtain the cyclic shift value C_(ν) according to the shift sequence number ν by using formula (1), formula (2), or formula (3).

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (4) to (11); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Optionally, in the case of ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1), the cyclic shift value determining module 1602 obtains the cyclic shift value C_(ν) by using formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1), the cyclic shift value determining module 1602 obtains the cyclic shift value C_(ν) by using formula (2);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the cyclic shift value determining module 1602 obtains the cyclic shift value C_(ν) by using formula (3).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

The base station in this embodiment may be configured to execute the technical solution in the method embodiment shown in FIG. 11. An implementation principle and a technical effect thereof are similar, and details are not described herein again.

FIG. 17 is a schematic structural diagram of Embodiment 3 of user equipment according to the present application. As shown in FIG. 17, the base station in this embodiment may include: a shift sequence number determining module 1701, a cyclic shift value determining module 1702, and a random access sequence generation module 1703. The shift sequence number determining module 1701 is configured to select a shift sequence number ν from a range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), where ν is an integer, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in a group, n_(group) ^(RA) is a quantity of groups, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in the last length that is insufficient for a group, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in first remaining sequence shifts, and

_(shift) ^(RA) is a quantity of UE candidate sequence shifts in second remaining sequence shifts. The cyclic shift value determining module 1702 is configured to obtain a cyclic shift value C_(ν) according to the shift sequence number ν by using formula (1), formula (2), or formula (3). The random access sequence generation module 1703 is configured to generate a random access sequence x_(u,C) _(ν) (n) according to the cyclic shift value C_(ν) by using formula (36).

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (4) to (11); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Optionally, in the case of ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1), the cyclic shift value determining module 1702 obtains the cyclic shift value C_(ν) by using formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1), the cyclic shift value determining module 1702 obtains the cyclic shift value C_(ν) by using formula (2);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the cyclic shift value determining module 1702 obtains the cyclic shift value C_(ν) by using formula (3).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

The user equipment in this embodiment may be configured to execute the technical solution in the method embodiment shown in FIG. 12. An implementation principle and a technical effect thereof are similar, and details are not described herein again.

The present application further provides a random access sequence generation system, including the base station in Embodiment 3 of the base station, and the user equipment in Embodiment 3 of the user equipment.

FIG. 18 is a schematic structural diagram of Embodiment 4 of a base station according to the present application. As shown in FIG. 18, the base station in this embodiment may include: a processor 1801 and a transmitter 1802. The processor 1801 is configured to generate notification signaling, where the notification signaling includes indication information, the indication information is used to instruct user equipment UE to select a shift sequence number from a range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the shift sequence number is an integer, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in a group, n_(group) ^(RA) is a quantity of groups, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in the last length that is insufficient for a group, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in first remaining sequence shifts, and

_(shift) ^(RA) is a quantity of UE candidate sequence shifts in second remaining sequence shifts. The transmitter 1802 is configured to send the notification signaling to the UE, so that the UE generates a random access sequence according to the indication information.

Optionally, the processor 1802 is further configured to:

select a shift sequence number from the range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1);

obtain a cyclic shift value according to the shift sequence number; and

generate a detection sequence according to the cyclic shift value, and detect, by using the detection sequence, a random access sequence sent by the UE, where the random access sequence is generated by the UE according to the indication information.

Optionally, the obtaining, by the processor 1802, a cyclic shift value according to the shift sequence number specifically includes:

obtaining the cyclic shift value C_(ν) according to the shift sequence number ν by using formula (1), formula (2), or formula (3).

Optionally, in the case of ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1), the processor 1802 obtains the cyclic shift value C_(ν) by using formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1), the processor 1802 obtains the cyclic shift value C_(ν) by using formula (2);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the processor 1802 obtains the cyclic shift value C_(ν) by using formula (3).

Optionally, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (4) to (11); or

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (12) to (19); or

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (20) to (27); or

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (28) to (35).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{{ZC}\;}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

The base station in this embodiment may be configured to execute the technical solution in the method embodiment shown in FIG. 1 or FIG. 2. An implementation principle and a technical effect thereof are similar, and details are not described herein again.

FIG. 19 is a schematic structural diagram of Embodiment 4 of user equipment according to the present application. As shown in FIG. 19, the user equipment in this embodiment may include a receiver 1901 and a processor 1902. The receiver 1901 is configured to receive notification signaling from a base station, where the notification signaling include indication information, the indication information is used to instruct the UE to select a shift sequence number from a range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the shift sequence number is an integer, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in a group, n_(group) ^(RA) is a quantity of groups, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in the last length that is insufficient for a group, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in first remaining sequence shifts, and

_(shift) ^(RA) is a quantity of UE candidate sequence shifts in second remaining sequence shifts. The processor 1902 is configured to: select a shift sequence number from the range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1) according to the notification signaling, obtain a cyclic shift value according to the shift sequence number, and generate a random access sequence according to the cyclic shift value.

Optionally, the obtaining, by the processor 1902, a cyclic shift value according to the shift sequence number specifically includes:

obtaining the cyclic shift value C_(ν) according to the shift sequence number ν by using formula (1), formula (2), or formula (3).

Optionally, in the case of ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1), the processor 1902 obtains the cyclic shift value C_(ν) by using formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1), the processor 1902 obtains the cyclic shift value C_(ν) by using formula (2);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the processor 1902 obtains the cyclic shift value C_(ν) by using formula (3).

Optionally, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (4) to (11); or

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (12) to (19); or

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (20) to (27); or

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (28) to (35).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Alternatively, in the case of

${\frac{N_{ZC} + N_{{CS}\;}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Optionally, the generating, by the processor 1902, a random access sequence according to the cyclic shift value specifically includes:

generating the random access sequence x_(u,C) _(ν) (n) according to the cyclic shift value C_(ν) by using the following formula (36): x _(u,C) _(ν) (n)=x _(u)((n+C _(ν))mod N _(ZC))  (36), where

N_(ZC) is a sequence length, and a ZC sequence whose root is u is defined as:

${{x_{u}(n)} = e^{{- j}\;\frac{\pi\;{{un}{({n + 1})}}}{N_{ZC}}}},$ 0≤n≤N_(ZC)−1.

The UE in this embodiment may be configured to execute the technical solution in Embodiment 3 or Embodiment 4 of the random access sequence generation method. An implementation principle and a technical effect thereof are similar, and details are not described herein again.

FIG. 20 is a schematic structural diagram of Embodiment 5 of a base station according to the present application. As shown in FIG. 20, the base station in this embodiment may include a processor 2001 and a memory 2002. The apparatus may further include a transmitter 2003 and a receiver 2004. The transmitter 2003 and the receiver 2004 may be connected to the processor 2001. The transmitter 2003 is configured to send data or information. The receiver 2004 is configured to receive data or information. The memory 2002 stores an executable instruction. When the apparatus runs, the processor 2001 communicates with the memory 2002. The processor 2001 invokes the executable instruction in the memory 2002, to perform the following operations:

selecting a shift sequence number ν from a range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), where ν is an integer, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in a group, n_(group) ^(RA) is a quantity of groups, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in the last length that is insufficient for a group, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in first remaining sequence shifts, and

_(shift) ^(RA) is a quantity of UE candidate sequence shifts in second remaining sequence shifts; and

obtaining a cyclic shift value C_(ν) according to the shift sequence number ν by using formula (1), formula (2), or formula (3).

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (4) to (11); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Optionally, in the case of ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1), the processor 2001 obtains the cyclic shift value C_(ν) by using formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1), the processor 2001 obtains the cyclic shift value C_(ν) by using formula (2);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the processor 2001 obtains the cyclic shift value C_(ν) by using formula (3).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

The base station in this embodiment may be configured to execute the technical solution in the method embodiment shown in FIG. 11. An implementation principle and a technical effect thereof are similar, and details are not described herein again.

In a schematic structural diagram of Embodiment 5 of user equipment, the user equipment in this embodiment has a same structure as that of the base station shown in FIG. 20, and may also include a processor and a memory. The apparatus may further include a transmitter and a receiver.

The transmitter and the receiver may be connected to the processor. The transmitter is configured to send data or information. The receiver is configured to receive data or information. The memory stores an executable instruction. When the apparatus runs, the processor communicates with the memory. The processor invokes the executable instruction in the memory, to perform the following operations:

selecting a shift sequence number ν from a range of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), where ν is an integer, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in a group, n_(group) ^(RA) is a quantity of groups, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in the last length that is insufficient for a group, n _(shift) ^(RA) is a quantity of UE candidate sequence shifts in first remaining sequence shifts, and

_(shift) ^(RA) is a quantity of UE candidate sequence shifts in second remaining sequence shifts;

obtaining a cyclic shift value C_(ν) according to the shift sequence number ν by using formula (1), formula (2), or formula (3); and

generating a random access sequence x_(u,C) _(ν) (n) according to the cyclic shift value C_(ν) by using formula (36).

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

_(start) satisfy formulas (4) to (11); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27); or n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Optionally, in the case of ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1), the processor obtains the cyclic shift value C_(ν) by using formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1), the processor obtains the cyclic shift value C_(ν) by using formula (2);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)−1)<ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), the processor obtains the cyclic shift value C_(ν) by using formula (3).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

The user equipment in this embodiment may be configured to execute the technical solution in the method embodiment shown in FIG. 12. An implementation principle and a technical effect thereof are similar, and details are not described herein again.

Persons of ordinary skill in the art may understand that all or some of the steps of the method embodiments may be implemented by a program instructing relevant hardware. The program may be stored in a computer-readable storage medium. When the program runs, the steps of the method embodiments are performed. The foregoing storage medium includes any medium that can store program code, such as a ROM, a RAM, a magnetic disk, or an optical disc.

Finally, it should be noted that the foregoing embodiments are merely intended for describing the technical solutions of the present application, but not for limiting the present application. Although the present application is described in detail with reference to the foregoing embodiments, persons of ordinary skill in the art should understand that they may still make modifications to the technical solutions described in the foregoing embodiments or make equivalent replacements to some or all technical features thereof, without departing from the scope of the technical solutions of the embodiments of the present application. 

What is claimed is:
 1. A method for generating a random access sequence in a communication system, comprising: obtaining, by a communication apparatus, a cyclic shift value C_(ν) according to a shift sequence number ν, wherein C _(ν) =d _(start) └ν/n _(shift) ^(RA)┘+(ν mod n _(shift) ^(RA))N _(CS)  (1), wherein ν is an integer, N_(CS) is a quantity of cyclic shifts, wherein for ${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (4) and (5), respectively, or for ${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (12) and (13), respectively, or for ${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (20) and (21), respectively, or for ${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (28) and (29), respectively, wherein $\begin{matrix} {{n_{shift}^{RA} = \left\lfloor \frac{{4d_{c}} - N_{ZC}}{N_{CS}} \right\rfloor},} & (4) \\ {{d_{start} = {{4d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}},} & (5) \\ {{n_{shift}^{RA} = \left\lfloor \frac{N_{ZC} - {3d_{u}}}{N_{CS}} \right\rfloor},} & (12) \\ {{d_{start} = {N_{ZC} - {3d_{u}} + {n_{shift}^{RA} \cdot N_{CS}}}},} & (13) \\ {{n_{shift}^{RA} = \left\lfloor \frac{{3d_{u}} - N_{ZC}}{N_{CS}} \right\rfloor},} & (20) \\ {{d_{start} = {{3d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}},} & (21) \\ {{n_{shift}^{RA} = \left\lfloor \frac{N_{ZC} - {2d_{u}}}{N_{CS}} \right\rfloor},} & (28) \\ {{d_{start} = {{2\left( {N_{ZC} - {2d_{u}}} \right)} + {n_{shift}^{RA} \cdot N_{CS}}}},} & (29) \end{matrix}$ and wherein N_(ZC) is a length of the random access sequence, a root of the random access sequence is u, $d_{u} = \left\{ {\begin{matrix} p & {0 \leq p < {N_{ZC}/2}} \\ {N_{ZC} - p} & {{another}\mspace{14mu}{value}} \end{matrix},} \right.$ and p is a minimum non-negative integer that satisfies (pu)mod N_(ZC)=1; and generating, by the communication apparatus, the random access sequence according to the cyclic shift value C_(ν).
 2. The method according to claim 1, wherein the generating the random access sequence according to the cyclic shift value C_(ν), comprises: generating, by the communication apparatus, the random access sequence x_(u,C) _(ν) (n) according to the cyclic shift value C_(ν) meeting formula (36): x _(u,C) _(ν) (n)=x _(u)((n+C _(ν))mod N _(ZC))  (36), wherein the root of the random access sequence u satisfies ${{x_{u}(n)} = e^{{- j}\frac{\pi\;{{un}{({n + 1})}}}{N_{ZC}}}},$ 0≤n≤N_(ZC)−1.
 3. The method according to claim 1, wherein a range of the shift sequence number ν is from 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), wherein for n_(shift) ^(RA) and d_(start) satisfy formulas (4) and (5), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA), and

_(shift) ^(RA) satisfy formulas (6) to (8) and (10), or for n_(shift) ^(RA) and d_(start) satisfy formulas (12) and (13), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA), and

_(shift) ^(RA) satisfy formulas (14) to (16) and (18), or for n_(shift) ^(RA) and d_(start) satisfy formulas (20) and (21), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA), and

_(shift) ^(RA) satisfy formulas (22) to (24) and (26), or for n_(shift) ^(RA) and d_(start) satisfy formulas (28) and (29), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA), and

_(shift) ^(RA) satisfy formulas (30) to (32) and (34), wherein $\begin{matrix} {\mspace{85mu}{{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor},}} & (6) \\ {\mspace{85mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{N_{ZC} - {3d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}},}} & (7) \\ {{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = \left\lfloor {{\min\left( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} \right)}/N_{CS}} \right\rfloor},} & (8) \\ {{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = \left\lfloor \left( {{{\left( {1 - {\min\left( {1,{\overset{\_}{n}}_{shift}^{RA}} \right)}} \right)\left( {d_{u} - {n_{group}^{RA} \cdot d}} \right)} + {{\min\left( {1,{\overset{\_}{n}}_{shift}^{RA}} \right)}\left( {{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}} \right\rfloor} - {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}},} \right. \right.} & (10) \\ {\mspace{79mu}{{n_{shift}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor},}} & (14) \\ {\mspace{76mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{{4d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}},}} & (15) \\ {{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = \left\lfloor {{\min\left( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{N_{ZC} - {3d_{u}} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} \right)}/N_{CS}} \right\rfloor},} & (16) \\ {\mspace{79mu}{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0},}} & (18) \\ {\mspace{79mu}{{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor},}} & (22) \\ {\mspace{85mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{N_{ZC} - {2d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}},}} & (23) \\ {\mspace{85mu}{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = 0},}} & (24) \\ {\mspace{79mu}{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0},}} & (26) \\ {\mspace{79mu}{{n_{group}^{RA} = \left\lfloor \frac{N_{ZC} - d_{u}}{d_{start}} \right\rfloor},}} & (30) \\ {\mspace{76mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{{3d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}},}} & (31) \\ {\mspace{76mu}{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = 0},}} & (32) \\ {\mspace{79mu}{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0.}} & (34) \end{matrix}$
 4. The method according to claim 3, further comprising: before the obtaining, by the communication apparatus, the cyclic shift value C_(ν), receiving, by the communication apparatus, indication information which indicates the range of the shift sequence number ν.
 5. The method according to claim 3, wherein ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1).
 6. The method according to claim 1, further comprising: after the generating, by the communication apparatus, the random access sequence, transmitting, by the communication apparatus, the random access sequence.
 7. The method according to claim 1, wherein d_(u) is a cyclic shift corresponding to the random access sequence when a Doppler frequency shift is a physical random access channel (PRACH) subcarrier spacing.
 8. An apparatus, comprising: a memory; and a processor coupled to the memory, and configured to execute the instructions stored in the memory to: obtain a cyclic shift value C_(ν) according to a shift sequence number ν, wherein C _(ν) =d _(start) └ν/n _(shift) ^(RA)┘+(ν mod n _(shift) ^(RA))N _(CS)  (1), wherein ν is an integer, N_(CS) is a quantity of cyclic shifts, wherein for ${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (4) and (5), respectively, or for ${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (12) and (13), respectively, or for ${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (20) and (21), respectively, or for ${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (28) and (29), respectively, wherein $\begin{matrix} {{n_{shift}^{RA} = \left\lfloor \frac{{4d_{u}} - N_{ZC}}{N_{CS}} \right\rfloor},} & (4) \\ {{d_{start} = {{4d_{u}} - N_{ZC} + {n_{shift}^{{RA}\;} \cdot N_{CS}}}},} & (5) \\ {{n_{shift}^{RA} = \left\lfloor \frac{N_{ZC} - {3d_{u}}}{N_{CS}} \right\rfloor},} & (12) \\ {{d_{start} = {N_{ZC} - {3d_{u}} + {n_{shift}^{{RA}\;} \cdot N_{CS}}}},} & (13) \\ {{n_{shift}^{RA} = \left\lfloor \frac{{3d_{u}} - N_{ZC}}{N_{CS}} \right\rfloor},} & (20) \\ {{d_{start} = {{3d_{u}} - N_{ZC} + {n_{shift}^{{RA}\;} \cdot N_{CS}}}},} & (21) \\ {{n_{shift}^{RA} = \left\lfloor \frac{N_{ZC} - {3d_{u}}}{N_{CS}} \right\rfloor},} & (28) \\ {{d_{start} = {{2\left( {N_{ZC} - {2d_{n}}} \right)} + {n_{shift}^{{RA}\;} \cdot N_{CS}}}},} & (29) \end{matrix}$ and wherein N_(ZC) is a length of a random access sequence, a root of the random access sequence is u, $d_{u} = \left\{ {\begin{matrix} p & {0 \leq p < {N_{ZC}/2}} \\ {N_{ZC} - p} & {{another}\mspace{14mu}{value}} \end{matrix},} \right.$ and p is a minimum non-negative integer that satisfies (pu)mod N_(ZC)=1; and generate the random access sequence according to the cyclic shift value C_(ν).
 9. The apparatus according to claim 8, wherein the processor is further configured to execute the instructions to cause the apparatus to: generate the random access sequence x_(u,C) _(ν) (n) according to the cyclic shift value C_(ν) meeting formula (36): x _(u,C) _(ν) (n)=x _(u)((n+C _(ν))mod N _(ZC))  (36), wherein the root of the random access sequence u satisfies ${{x_{u}(n)} = e^{{- j}\;\frac{\pi\;{un}{({n + 1})}}{N_{ZC}}}},$ 0≤n≤N_(ZC)−1.
 10. The apparatus according to claim 8, wherein a range of the shift sequence number ν is from 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), wherein for n_(shift) ^(RA) and d_(start) satisfy formulas (4) and (5), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA), and

_(shift) ^(RA) satisfy formulas (6) to (8) and (10), or for n_(shift) ^(RA) and d_(start) satisfy formulas (12) and (13), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA), and

_(shift) ^(RA) satisfy formulas (14) to (16) and (18), or for n_(shift) ^(RA) and d_(start) satisfy formulas (20) and (21), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA), and

_(shift) ^(RA) satisfy formulas (22) to (24) and (26), or for n_(shift) ^(RA) and d_(start) satisfy formulas (28) and (29), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA), and

_(shift) ^(RA) satisfy formulas (30) to (32) and (34), wherein $\begin{matrix} {\mspace{79mu}{{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor},}} & (6) \\ {\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{N_{ZC} - {3d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}},}} & (7) \\ {\mspace{79mu}{{{\overset{=}{n}}_{shift}^{RA} = \left\lfloor {{\min\left( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} \right)}/N_{CS}} \right\rfloor},}} & (8) \\ {{{\overset{\equiv}{n}}_{shift}^{RA} = {\left\lfloor {\left( {{\left( {1 - {\min\left( {1,{\overset{\_}{n}}_{shift}^{RA}} \right)}} \right)\left( {d_{u} - {n_{group}^{RA} \cdot d_{start}}} \right)} + {{\min\left( {1,{\overset{\_}{n}}_{shift}^{RA}} \right)}\left( {{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}} \right)}} \right)/N_{CS}} \right\rfloor - {\overset{=}{n}}_{shift}^{RA}}},} & (10) \\ {\mspace{79mu}{{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor},}} & (14) \\ {\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{{4d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}},}} & (15) \\ {\mspace{79mu}{{{\overset{=}{n}}_{shift}^{RA} = \left\lfloor {{\min\left( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{N_{ZC} - {3d_{u}} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} \right)}/N_{CS}} \right\rfloor},}} & (16) \\ {\mspace{79mu}{{{\overset{\equiv}{n}}_{shift}^{RA} = 0},}} & (18) \\ {\mspace{79mu}{{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor},}} & (22) \\ {\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{N_{ZC} - {2d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}},}} & (23) \\ {\mspace{79mu}{{{\overset{=}{n}}_{shift}^{RA} = 0},}} & (24) \\ {\mspace{79mu}{{{\overset{\equiv}{n}}_{shift}^{RA} = 0},}} & (26) \\ {\mspace{79mu}{{n_{group}^{RA} = \left\lfloor \frac{N_{ZC} - d_{u}}{d_{start}} \right\rfloor},}} & (30) \\ {\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{{3d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}},}} & (31) \\ {\mspace{79mu}{{{\overset{=}{n}}_{shift}^{RA} = 0},}} & (32) \\ {\mspace{79mu}{{\overset{\equiv}{n}}_{shift}^{RA} = 0.}} & (34) \end{matrix}$
 11. The apparatus according to claim 10, wherein ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1).
 12. The apparatus according to claim 8, wherein d_(u) is a cyclic shift corresponding to the random access sequence when a Doppler frequency shift is a physical random access channel (PRACH) subcarrier spacing.
 13. A non-transitory computer-readable medium storing computer instructions which, when executed by one or more processors, cause the one or more processors to perform the steps of: obtaining a cyclic shift value C_(ν) according to a shift sequence number ν, wherein C _(ν) =d _(start) └ν/n _(shift) ^(RA)┘+(ν mod n _(shift) ^(RA))N _(CS)  (1), wherein ν is an integer, N_(CS) is a quantity of cyclic shifts, wherein for ${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (4) and (5), respectively, or for ${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (12) and (13), respectively, or for ${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (20) and (21), respectively, or for ${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (28) and (29), respectively, wherein $\begin{matrix} {{n_{shift}^{RA} = \left\lfloor \frac{{4d_{u}} - N_{ZC}}{N_{CS}} \right\rfloor},} & (4) \\ {{d_{start} = {{4d_{u}} - N_{ZC} + {n_{shift}^{{RA}\;} \cdot N_{CS}}}},} & (5) \\ {{n_{shift}^{RA} = \left\lfloor \frac{N_{ZC} - {3d_{u}}}{N_{CS}} \right\rfloor},} & (12) \\ {{d_{start} = {N_{ZC} - {3d_{u}} + {n_{shift}^{{RA}\;} \cdot N_{CS}}}},} & (13) \\ {{n_{shift}^{RA} = \left\lfloor \frac{{3d_{u}} - N_{ZC}}{N_{CS}} \right\rfloor},} & (20) \\ {{d_{start} = {{3d_{u}} - N_{ZC} + {n_{shift}^{{RA}\;} \cdot N_{CS}}}},} & (21) \\ {{n_{shift}^{RA} = \left\lfloor \frac{N_{ZC} - {3d_{u}}}{N_{CS}} \right\rfloor},} & (28) \\ {{d_{start} = {{2\left( {N_{ZC} - {2d_{n}}} \right)} + {n_{shift}^{{RA}\;} \cdot N_{CS}}}},} & (29) \end{matrix}$ and wherein N_(ZC) is a length of a random access sequence, a root of the random access sequence is u, $d_{u} = \left\{ {\begin{matrix} p & {0 \leq p < {N_{ZC}/2}} \\ {N_{ZC} - p} & {{another}\mspace{14mu}{value}} \end{matrix},} \right.$ and p is a minimum non-negative integer that satisfies (pu)mod N_(ZC)=1; and generating the random access sequence according to the cyclic shift value C_(ν).
 14. The non-transitory computer-readable medium according to claim 13, wherein the generating the random access sequence according to the cyclic shift value C_(ν), comprises: generating the random access sequence x_(u,C) _(ν) (n) according to the cyclic shift value C_(ν) meeting formula (36): x _(u,C) _(ν) (n)=x _(u)((n+C _(ν))mod N _(ZC))  (36), wherein the root of the random access sequence u satisfies ${{x_{u}(n)} = e^{{- j}\;\frac{\pi\;{un}{({n + 1})}}{N_{ZC}}}},$ 0≤n≤N_(ZC)−1.
 15. The non-transitory computer-readable medium according to claim 13, wherein a range of the shift sequence number ν is from 0 to ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1).
 16. The apparatus according to claim 8, wherein the processor is further configured to execute the instructions to: receive indication information which indicates a range of the shift sequence number ν.
 17. The apparatus according to claim 8, wherein the processor is further configured to execute the instructions to: transmit the random access sequence.
 18. A method for detecting a random access sequence in a communication system, comprising: obtaining, by a communication apparatus, a cyclic shift value C_(ν) according to a shift sequence number ν, wherein C _(ν) =d _(start) └ν/n _(shift) ^(RA)┘+(ν mod n _(shift) ^(RA))N _(CS)  (1), wherein ν is an integer, N_(CS) is a quantity of cyclic shifts, wherein for ${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (4) and (5), respectively, or for ${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (12) and (13), respectively, or for ${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (20) and (21), respectively, or for ${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (28) and (29), respectively, wherein $\begin{matrix} {{n_{shift}^{RA} = \left\lfloor \frac{{4d_{u}} - N_{ZC}}{N_{CS}} \right\rfloor},} & (4) \\ {{d_{start} = {{4d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}},} & (5) \\ {{n_{shift}^{RA} = \left\lfloor \frac{N_{ZC} - {3d_{u}}}{N_{CS}} \right\rfloor},} & (12) \\ {{d_{start} = {N_{ZC} - {3d_{u}} + {n_{shift}^{RA} \cdot N_{CS}}}},} & (13) \\ {{n_{shift}^{RA} = \left\lfloor \frac{{3d_{u}} - N_{ZC}}{N_{CS}} \right\rfloor},} & (20) \\ {{d_{start} = {{3d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}},} & (21) \\ {{n_{shift}^{RA} = \left\lfloor \frac{N_{ZC} - {2d_{u}}}{N_{CS}} \right\rfloor},} & (28) \\ {{d_{start} = {{2\left( {N_{ZC} - {2d_{u}}} \right)} + {n_{shift}^{RA} \cdot N_{CS}}}},} & (29) \end{matrix}$ and wherein N_(ZC) is a length of a random access sequence, a root of the random access sequence is u, $d_{u} = \left\{ {\begin{matrix} p & {0 \leq p < {N_{ZC}/2}} \\ {N_{ZC} - p} & {{another}\mspace{14mu}{value}} \end{matrix},} \right.$ and p is a minimum non-negative integer that satisfies (pu)mod N_(ZC)=1; and detecting, by the communication apparatus, the random access sequence according to the cyclic shift value C_(ν).
 19. The method according to claim 18, wherein a range of the shift sequence number ν is from 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), wherein for n_(shift) ^(RA) and d_(start) satisfy formulas (4) and (5), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA), and

_(shift) ^(RA) satisfy formulas (6) to (8) and (10), or for n_(shift) ^(RA) and d_(start) satisfy formulas (12) and (13), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA), and

_(shift) ^(RA) satisfy formulas (14) to (16) and (18), or for n_(shift) ^(RA) and d_(start) satisfy formulas (20) and (21), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA), and

_(shift) ^(RA) satisfy formulas (22) to (24) and (26), or for n_(shift) ^(RA) and d_(start) satisfy formulas (28) and (29), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA), and

_(shift) ^(RA) satisfy formulas (30) to (32) and (34), wherein $\begin{matrix} {\mspace{79mu}{{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor},}} & (6) \\ {\mspace{79mu}{{{\overset{¯}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{N_{ZC} - {3d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}},}} & (7) \\ {{{\overset{¯}{\overset{¯}{n}}}_{shift}^{RA} = \left\lfloor {{\min\begin{pmatrix} {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},} & {{4d_{u}} - N_{ZC} - {{\overset{¯}{n}}_{shift}^{RA}N_{CS}}} \end{pmatrix}}/N_{CS}} \right\rfloor},} & (8) \\ {{{\overset{¯}{\overset{¯}{\overset{¯}{n}}}}_{shift}^{RA} = {\left\lfloor {\left( {{\left( {1 - {\min\left( {1,{\overset{¯}{n}}_{shift}^{RA}} \right)}} \right)\left( {d_{u} - {n_{group}^{RA} \cdot d_{start}}} \right)} + {{\min\left( {1,{\overset{¯}{n}}_{shift}^{RA}} \right)}\left( {{4d_{u}} - N_{ZC} - {{\overset{¯}{n}}_{shift}^{RA}N_{CS}}} \right)}} \right)/N_{CS}} \right\rfloor - {\overset{¯}{\overset{¯}{n}}}_{shift}^{RA}}},} & (10) \\ {\mspace{79mu}{{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor},}} & (14) \\ {\mspace{79mu}{{{\overset{¯}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{{4d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}},}} & (15) \\ {\left. {{\overset{¯}{\overset{¯}{n}}}_{shift}^{RA} = \left\lfloor {\min\left( \begin{matrix} {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},} & {\left. {N_{ZC} - {3d_{u}} - {{\overset{¯}{n}}_{shift}^{RA}N_{CS}}} \right)/N_{CS}} \end{matrix} \right.} \right.} \right\rfloor,} & (16) \\ {\mspace{79mu}{{{\overset{¯}{\overset{¯}{\overset{¯}{n}}}}_{shift}^{RA} = 0},}} & (18) \\ {\mspace{79mu}{{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor},}} & (22) \\ {\mspace{79mu}{{{\overset{¯}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{N_{ZC} - {2d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}},}} & (23) \\ {\mspace{79mu}{{n_{shift}^{RA} = 0},}} & (24) \\ {\mspace{79mu}{{{\overset{¯}{\overset{¯}{\overset{¯}{n}}}}_{shift}^{RA} = 0},}} & (26) \\ {\mspace{79mu}{{n_{group}^{RA} = \left\lfloor \frac{N_{ZC} - d_{u}}{d_{start}} \right\rfloor},}} & (30) \\ {\mspace{79mu}{{{\overset{¯}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{{3d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}},}} & (31) \\ {\mspace{79mu}{{{\overset{¯}{\overset{¯}{n}}}_{shift}^{RA} = 0},}} & (32) \\ {\mspace{79mu}{{\overset{¯}{\overset{¯}{\overset{¯}{n}}}}_{shift}^{RA} = 0.}} & (34) \end{matrix}$
 20. The method according to claim 18, wherein ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1).
 21. The method according to claim 18, further comprising: transmitting, by the communication apparatus, indication information which indicates the range of the shift sequence number ν.
 22. An apparatus, comprising: a memory; and a processor coupled to the memory, and configured to execute the instructions stored in the memory to: obtain a cyclic shift value C_(ν) according to a shift sequence number ν, wherein C _(ν) =d _(start) └ν/n _(shift) ^(RA)┘+(ν mod n _(shift) ^(RA))N _(CS)  (1), wherein ν is an integer, N_(CS) is a quantity of cyclic shifts, wherein for ${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (4) and (5), respectively, or for ${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (12) and (13), respectively, or for ${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (20) and (21), respectively, or for ${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (28) and (29), respectively, wherein $\begin{matrix} {{n_{shift}^{RA} = \left\lfloor \frac{{4d_{u}} - N_{ZC}}{N_{CS}} \right\rfloor},} & (4) \\ {{d_{start} = {{4d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}},} & (5) \\ {{n_{shift}^{RA} = \left\lfloor \frac{N_{ZC} - {3d_{u}}}{N_{CS}} \right\rfloor},} & (12) \\ {{d_{start} = {N_{ZC} - {3d_{u}} + {n_{shift}^{RA} \cdot N_{CS}}}},} & (13) \\ {{n_{shift}^{RA} = \left\lfloor \frac{{3d_{u}} - N_{ZC}}{N_{CS}} \right\rfloor},} & (20) \\ {{d_{start} = {{3d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}},} & (21) \\ {{n_{shift}^{RA} = \left\lfloor \frac{N_{ZC} - {2d_{u}}}{N_{CS}} \right\rfloor},} & (28) \\ {{d_{start} = {{2\left( {N_{ZC} - {2d_{u}}} \right)} + {n_{shift}^{RA} \cdot N_{CS}}}},} & (29) \end{matrix}$ and wherein N_(ZC) is a length of a random access sequence, a root of the random access sequence is u, $d_{u} = \left\{ {\begin{matrix} p & {0 \leq p < {N_{ZC}/2}} \\ {N_{ZC} - p} & {{another}\mspace{14mu}{value}} \end{matrix},} \right.$ and p is a minimum non-negative integer that satisfies (pu)mod N_(ZC)=1; and detect the random access sequence according to the cyclic shift value C_(ν).
 23. The apparatus according to claim 22, wherein a range of the shift sequence number ν is from 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift) ^(RA)+

_(shift) ^(RA)−1), wherein for n_(shift) ^(RA) and d_(start) satisfy formulas (4) and (5), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA), and

_(shift) ^(RA) satisfy formulas (6) to (8) and (10), or for n_(shift) ^(RA) and d_(start) satisfy formulas (12) and (13), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA), and

_(shift) ^(RA) satisfy formulas (14) to (16) and (18), or for n_(shift) ^(RA) and d_(start) satisfy formulas (20) and (21), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA), and

_(shift) ^(RA) satisfy formulas (22) to (24) and (26), or for n_(shift) ^(RA) and d_(start) satisfy formulas (28) and (29), n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA), and

_(shift) ^(RA) satisfy formulas (30) to (32) and (34), wherein $\begin{matrix} {\mspace{79mu}{{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor},}} & (6) \\ {\mspace{79mu}{{{\overset{¯}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{N_{ZC} - {3d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}},}} & (7) \\ {{{\overset{¯}{\overset{¯}{n}}}_{shift}^{RA} = \left\lfloor {{\min\begin{pmatrix} {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},} & {{4d_{u}} - N_{ZC} - {{\overset{¯}{n}}_{shift}^{RA}N_{CS}}} \end{pmatrix}}/N_{CS}} \right\rfloor},} & (8) \\ {{{\overset{¯}{\overset{¯}{\overset{¯}{n}}}}_{shift}^{RA} = {\left\lfloor {\left( {{\left( {1 - {\min\left( {1,{\overset{¯}{n}}_{shift}^{RA}} \right)}} \right)\left( {d_{u} - {n_{group}^{RA} \cdot d_{start}}} \right)} + {{\min\left( {1,{\overset{¯}{n}}_{shift}^{RA}} \right)}\left( {{4d_{u}} - N_{ZC} - {{\overset{¯}{n}}_{shift}^{RA}N_{CS}}} \right)}} \right)/N_{CS}} \right\rfloor - {\overset{¯}{\overset{¯}{n}}}_{shift}^{RA}}},} & (10) \\ {\mspace{79mu}{{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor},}} & (14) \\ {\mspace{79mu}{{{\overset{¯}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{{4d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}},}} & (15) \\ {\left. {{\overset{¯}{\overset{¯}{n}}}_{shift}^{RA} = \left\lfloor {\min\left( \begin{matrix} {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},} & {\left. {N_{ZC} - {3d_{u}} - {{\overset{¯}{n}}_{shift}^{RA}N_{CS}}} \right)/N_{CS}} \end{matrix} \right.} \right.} \right\rfloor,} & (16) \\ {\mspace{79mu}{{{\overset{¯}{\overset{¯}{\overset{¯}{n}}}}_{shift}^{RA} = 0},}} & (18) \\ {\mspace{79mu}{{n_{group}^{RA} = \left\lfloor \frac{d_{u}}{d_{start}} \right\rfloor},}} & (22) \\ {\mspace{79mu}{{{\overset{¯}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{N_{ZC} - {2d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}},}} & (23) \\ {\mspace{79mu}{{n_{shift}^{RA} = 0},}} & (24) \\ {\mspace{79mu}{{{\overset{¯}{\overset{¯}{\overset{¯}{n}}}}_{shift}^{RA} = 0},}} & (26) \\ {\mspace{79mu}{{n_{group}^{RA} = \left\lfloor \frac{N_{ZC} - d_{u}}{d_{start}} \right\rfloor},}} & (30) \\ {\mspace{79mu}{{{\overset{¯}{n}}_{shift}^{RA} = {\max\left( {\left\lfloor \frac{{3d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \right\rfloor,0} \right)}},}} & (31) \\ {\mspace{79mu}{{{\overset{¯}{\overset{¯}{n}}}_{shift}^{RA} = 0},}} & (32) \\ {\mspace{79mu}{{\overset{¯}{\overset{¯}{\overset{¯}{n}}}}_{shift}^{RA} = 0.}} & (34) \end{matrix}$
 24. The apparatus according to claim 22, wherein ν≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1).
 25. The apparatus according to claim 22, wherein the processor is further configured to execute the instructions to: transmit indication information which indicates the range of the shift sequence number ν. 